/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:16:13,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:16:13,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:16:13,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:16:13,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:16:13,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:16:13,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:16:13,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:16:13,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:16:13,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:16:13,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:16:13,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:16:13,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:16:13,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:16:13,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:16:13,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:16:13,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:16:13,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:16:13,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:16:13,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:16:13,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:16:13,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:16:13,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:16:13,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:16:13,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:16:13,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:16:13,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:16:13,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:16:13,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:16:13,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:16:13,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:16:13,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:16:13,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:16:13,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:16:13,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:16:13,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:16:13,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:16:13,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:16:13,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:16:13,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:16:13,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:16:13,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:16:13,173 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:16:13,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:16:13,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:16:13,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:16:13,177 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:16:13,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:16:13,177 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:16:13,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:16:13,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:16:13,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:16:13,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:16:13,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:16:13,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:16:13,179 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:16:13,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:16:13,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:16:13,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:16:13,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:16:13,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:16:13,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:16:13,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:16:13,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:16:13,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:16:13,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:16:13,182 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:16:13,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:16:13,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:16:13,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:16:13,496 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:16:13,497 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:16:13,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.oepc.i [2021-03-26 00:16:13,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d56351/9e9b853a90104984827a23ddf6dd95fb/FLAG9460e363a [2021-03-26 00:16:14,087 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:16:14,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_pso.oepc.i [2021-03-26 00:16:14,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d56351/9e9b853a90104984827a23ddf6dd95fb/FLAG9460e363a [2021-03-26 00:16:14,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d56351/9e9b853a90104984827a23ddf6dd95fb [2021-03-26 00:16:14,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:16:14,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:16:14,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:16:14,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:16:14,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:16:14,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:16:14" (1/1) ... [2021-03-26 00:16:14,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fed3d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:14, skipping insertion in model container [2021-03-26 00:16:14,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:16:14" (1/1) ... [2021-03-26 00:16:14,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:16:14,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:16:14,743 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/mix037_pso.oepc.i[949,962] [2021-03-26 00:16:14,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:16:14,936 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:16:14,947 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/mix037_pso.oepc.i[949,962] [2021-03-26 00:16:15,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:16:15,082 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:16:15,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15 WrapperNode [2021-03-26 00:16:15,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:16:15,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:16:15,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:16:15,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:16:15,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:16:15,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:16:15,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:16:15,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:16:15,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... [2021-03-26 00:16:15,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:16:15,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:16:15,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:16:15,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:16:15,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:16:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:16:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:16:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:16:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:16:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:16:15,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:16:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:16:15,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:16:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:16:15,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:16:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:16:15,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:16:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:16:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:16:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:16:15,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:16:15,285 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:16:17,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:16:17,248 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:16:17,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:16:17 BoogieIcfgContainer [2021-03-26 00:16:17,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:16:17,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:16:17,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:16:17,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:16:17,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:16:14" (1/3) ... [2021-03-26 00:16:17,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fc7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:16:17, skipping insertion in model container [2021-03-26 00:16:17,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:16:15" (2/3) ... [2021-03-26 00:16:17,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fc7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:16:17, skipping insertion in model container [2021-03-26 00:16:17,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:16:17" (3/3) ... [2021-03-26 00:16:17,256 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_pso.oepc.i [2021-03-26 00:16:17,261 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:16:17,265 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:16:17,265 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:16:17,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,313 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,334 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:16:17,353 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:16:17,387 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:16:17,404 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:16:17,404 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:16:17,404 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:16:17,404 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:16:17,405 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:16:17,405 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:16:17,405 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:16:17,405 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:16:17,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 00:16:17,449 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 00:16:17,449 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:17,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:16:17,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 00:16:17,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 00:16:17,459 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:17,468 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 00:16:17,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 00:16:17,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 00:16:17,490 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 00:16:17,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:17,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:16:17,494 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-26 00:16:18,967 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:16:19,445 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:16:19,588 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:16:21,217 INFO L154 LiptonReduction]: Checked pairs total: 5194 [2021-03-26 00:16:21,217 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 00:16:21,219 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3761 [2021-03-26 00:16:21,228 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 00:16:21,228 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:21,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:21,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:21,229 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 00:16:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1584989629, now seen corresponding path program 1 times [2021-03-26 00:16:21,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:21,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857267805] [2021-03-26 00:16:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:21,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:21,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:21,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:21,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:21,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857267805] [2021-03-26 00:16:21,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:21,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:16:21,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797794808] [2021-03-26 00:16:21,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:16:21,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:16:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:16:21,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-26 00:16:21,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:21,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:21,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-26 00:16:21,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:21,680 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-26 00:16:21,680 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:21,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2174 event pairs, 110 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-26 00:16:21,687 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 00:16:21,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-26 00:16:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:16:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:16:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 00:16:21,703 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2021-03-26 00:16:21,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 00:16:21,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 00:16:21,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:21,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 00:16:21,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:21,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:21,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:21,717 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 538 transitions. [2021-03-26 00:16:21,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-26 00:16:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:16:21,725 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:21,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 00:16:21,732 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 00:16:21,732 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:21,732 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:21,732 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:21,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:21,738 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 00:16:21,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:21,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:16:21,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-26 00:16:22,894 INFO L154 LiptonReduction]: Checked pairs total: 2761 [2021-03-26 00:16:22,894 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:16:22,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1162 [2021-03-26 00:16:22,897 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 80 flow [2021-03-26 00:16:22,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:22,898 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:22,898 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 00:16:22,898 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:16:22,898 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 00:16:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1061219016, now seen corresponding path program 1 times [2021-03-26 00:16:22,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:22,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869897870] [2021-03-26 00:16:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:23,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:23,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:23,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:23,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:23,024 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:16:23,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:16:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:23,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869897870] [2021-03-26 00:16:23,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:23,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:23,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637577352] [2021-03-26 00:16:23,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:23,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:23,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 208 [2021-03-26 00:16:23,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:23,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 208 [2021-03-26 00:16:23,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:23,068 INFO L129 PetriNetUnfolder]: 7/53 cut-off events. [2021-03-26 00:16:23,068 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:16:23,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 53 events. 7/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2021-03-26 00:16:23,069 INFO L132 encePairwiseOnDemand]: 203/208 looper letters, 3 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2021-03-26 00:16:23,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 118 flow [2021-03-26 00:16:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 913 transitions. [2021-03-26 00:16:23,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778846153846154 [2021-03-26 00:16:23,072 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 913 transitions. [2021-03-26 00:16:23,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 913 transitions. [2021-03-26 00:16:23,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:23,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 913 transitions. [2021-03-26 00:16:23,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.6) internal successors, (913), 5 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,079 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,079 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 80 flow. Second operand 5 states and 913 transitions. [2021-03-26 00:16:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 118 flow [2021-03-26 00:16:23,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:23,080 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 97 flow [2021-03-26 00:16:23,080 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-26 00:16:23,081 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2021-03-26 00:16:23,081 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:23,081 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-26 00:16:23,081 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-26 00:16:23,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 97 flow [2021-03-26 00:16:23,087 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-03-26 00:16:23,087 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:16:23,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 43 events. 3/43 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-26 00:16:23,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-26 00:16:23,819 INFO L154 LiptonReduction]: Checked pairs total: 1422 [2021-03-26 00:16:23,819 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:16:23,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 738 [2021-03-26 00:16:23,821 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 89 flow [2021-03-26 00:16:23,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:23,822 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:23,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:16:23,822 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 00:16:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1041313610, now seen corresponding path program 1 times [2021-03-26 00:16:23,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:23,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381952068] [2021-03-26 00:16:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:23,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:23,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:23,905 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:16:23,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:16:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:23,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381952068] [2021-03-26 00:16:23,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:23,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:16:23,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986281443] [2021-03-26 00:16:23,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:23,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:23,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:23,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:23,925 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 212 [2021-03-26 00:16:23,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:23,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:23,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 212 [2021-03-26 00:16:23,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:24,003 INFO L129 PetriNetUnfolder]: 101/278 cut-off events. [2021-03-26 00:16:24,003 INFO L130 PetriNetUnfolder]: For 113/171 co-relation queries the response was YES. [2021-03-26 00:16:24,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 278 events. 101/278 cut-off events. For 113/171 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1462 event pairs, 15 based on Foata normal form. 15/282 useless extension candidates. Maximal degree in co-relation 569. Up to 137 conditions per place. [2021-03-26 00:16:24,007 INFO L132 encePairwiseOnDemand]: 204/212 looper letters, 13 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-26 00:16:24,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 169 flow [2021-03-26 00:16:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:16:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:16:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2021-03-26 00:16:24,010 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8148584905660378 [2021-03-26 00:16:24,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2021-03-26 00:16:24,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2021-03-26 00:16:24,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:24,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2021-03-26 00:16:24,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:24,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:24,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:24,015 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 89 flow. Second operand 4 states and 691 transitions. [2021-03-26 00:16:24,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 169 flow [2021-03-26 00:16:24,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 154 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:24,019 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 148 flow [2021-03-26 00:16:24,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-26 00:16:24,019 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-26 00:16:24,020 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:24,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 148 flow [2021-03-26 00:16:24,021 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 148 flow [2021-03-26 00:16:24,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 148 flow [2021-03-26 00:16:24,067 INFO L129 PetriNetUnfolder]: 89/277 cut-off events. [2021-03-26 00:16:24,067 INFO L130 PetriNetUnfolder]: For 145/167 co-relation queries the response was YES. [2021-03-26 00:16:24,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 277 events. 89/277 cut-off events. For 145/167 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1633 event pairs, 41 based on Foata normal form. 2/262 useless extension candidates. Maximal degree in co-relation 574. Up to 131 conditions per place. [2021-03-26 00:16:24,072 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-26 00:16:24,451 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 00:16:24,607 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 00:16:24,962 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 00:16:25,129 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 00:16:25,156 INFO L154 LiptonReduction]: Checked pairs total: 906 [2021-03-26 00:16:25,156 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:25,156 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1136 [2021-03-26 00:16:25,158 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 146 flow [2021-03-26 00:16:25,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:25,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:25,158 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:25,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:16:25,159 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 00:16:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash -618752367, now seen corresponding path program 1 times [2021-03-26 00:16:25,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:25,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419077025] [2021-03-26 00:16:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:25,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:25,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:25,199 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:25,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:25,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:25,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:25,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 00:16:25,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419077025] [2021-03-26 00:16:25,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:25,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:25,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285012078] [2021-03-26 00:16:25,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:25,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:25,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 213 [2021-03-26 00:16:25,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 146 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 00:16:25,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:25,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 213 [2021-03-26 00:16:25,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:25,385 INFO L129 PetriNetUnfolder]: 776/1439 cut-off events. [2021-03-26 00:16:25,386 INFO L130 PetriNetUnfolder]: For 312/414 co-relation queries the response was YES. [2021-03-26 00:16:25,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 1439 events. 776/1439 cut-off events. For 312/414 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 10325 event pairs, 325 based on Foata normal form. 90/1236 useless extension candidates. Maximal degree in co-relation 3068. Up to 949 conditions per place. [2021-03-26 00:16:25,398 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 12 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-03-26 00:16:25,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 218 flow [2021-03-26 00:16:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 914 transitions. [2021-03-26 00:16:25,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8582159624413146 [2021-03-26 00:16:25,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 914 transitions. [2021-03-26 00:16:25,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 914 transitions. [2021-03-26 00:16:25,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:25,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 914 transitions. [2021-03-26 00:16:25,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:25,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:25,407 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:25,407 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 146 flow. Second operand 5 states and 914 transitions. [2021-03-26 00:16:25,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 218 flow [2021-03-26 00:16:25,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 214 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:16:25,412 INFO L241 Difference]: Finished difference. Result has 51 places, 45 transitions, 217 flow [2021-03-26 00:16:25,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2021-03-26 00:16:25,412 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2021-03-26 00:16:25,413 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:25,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 217 flow [2021-03-26 00:16:25,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 217 flow [2021-03-26 00:16:25,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 217 flow [2021-03-26 00:16:25,520 INFO L129 PetriNetUnfolder]: 632/1232 cut-off events. [2021-03-26 00:16:25,520 INFO L130 PetriNetUnfolder]: For 977/1274 co-relation queries the response was YES. [2021-03-26 00:16:25,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 1232 events. 632/1232 cut-off events. For 977/1274 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 9079 event pairs, 300 based on Foata normal form. 5/1082 useless extension candidates. Maximal degree in co-relation 3469. Up to 751 conditions per place. [2021-03-26 00:16:25,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 808 [2021-03-26 00:16:25,791 INFO L154 LiptonReduction]: Checked pairs total: 1106 [2021-03-26 00:16:25,791 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:25,791 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 378 [2021-03-26 00:16:25,792 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 211 flow [2021-03-26 00:16:25,793 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 00:16:25,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:25,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:25,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:16:25,793 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 00:16:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -891292389, now seen corresponding path program 1 times [2021-03-26 00:16:25,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:25,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12579871] [2021-03-26 00:16:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:25,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:25,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:25,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:25,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:25,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:25,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:25,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12579871] [2021-03-26 00:16:25,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:25,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:25,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557038226] [2021-03-26 00:16:25,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:25,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:25,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 213 [2021-03-26 00:16:25,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:25,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:25,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 213 [2021-03-26 00:16:25,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:26,041 INFO L129 PetriNetUnfolder]: 797/1550 cut-off events. [2021-03-26 00:16:26,041 INFO L130 PetriNetUnfolder]: For 1802/2344 co-relation queries the response was YES. [2021-03-26 00:16:26,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 1550 events. 797/1550 cut-off events. For 1802/2344 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 11650 event pairs, 423 based on Foata normal form. 53/1409 useless extension candidates. Maximal degree in co-relation 4415. Up to 983 conditions per place. [2021-03-26 00:16:26,058 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2021-03-26 00:16:26,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 203 flow [2021-03-26 00:16:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:16:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:16:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2021-03-26 00:16:26,061 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615023474178404 [2021-03-26 00:16:26,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2021-03-26 00:16:26,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2021-03-26 00:16:26,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:26,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2021-03-26 00:16:26,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,066 INFO L185 Difference]: Start difference. First operand has 51 places, 44 transitions, 211 flow. Second operand 4 states and 734 transitions. [2021-03-26 00:16:26,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 203 flow [2021-03-26 00:16:26,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:26,074 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 199 flow [2021-03-26 00:16:26,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-26 00:16:26,074 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-26 00:16:26,075 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:26,075 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 199 flow [2021-03-26 00:16:26,075 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 199 flow [2021-03-26 00:16:26,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 199 flow [2021-03-26 00:16:26,253 INFO L129 PetriNetUnfolder]: 813/1571 cut-off events. [2021-03-26 00:16:26,253 INFO L130 PetriNetUnfolder]: For 1439/1665 co-relation queries the response was YES. [2021-03-26 00:16:26,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4379 conditions, 1571 events. 813/1571 cut-off events. For 1439/1665 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 12051 event pairs, 419 based on Foata normal form. 4/1378 useless extension candidates. Maximal degree in co-relation 4362. Up to 1010 conditions per place. [2021-03-26 00:16:26,275 INFO L142 LiptonReduction]: Number of co-enabled transitions 678 [2021-03-26 00:16:26,506 INFO L154 LiptonReduction]: Checked pairs total: 472 [2021-03-26 00:16:26,506 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:26,506 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 431 [2021-03-26 00:16:26,507 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 199 flow [2021-03-26 00:16:26,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:26,508 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:26,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:16:26,508 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 00:16:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1086748655, now seen corresponding path program 1 times [2021-03-26 00:16:26,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:26,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804758912] [2021-03-26 00:16:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:26,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:26,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:26,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:26,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:26,554 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:26,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:26,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:26,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:26,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804758912] [2021-03-26 00:16:26,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:26,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:26,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249336825] [2021-03-26 00:16:26,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:16:26,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:16:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:16:26,563 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 213 [2021-03-26 00:16:26,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 199 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 00:16:26,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:26,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 213 [2021-03-26 00:16:26,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:26,773 INFO L129 PetriNetUnfolder]: 822/1621 cut-off events. [2021-03-26 00:16:26,773 INFO L130 PetriNetUnfolder]: For 1506/2651 co-relation queries the response was YES. [2021-03-26 00:16:26,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 1621 events. 822/1621 cut-off events. For 1506/2651 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 12081 event pairs, 132 based on Foata normal form. 249/1696 useless extension candidates. Maximal degree in co-relation 5579. Up to 1122 conditions per place. [2021-03-26 00:16:26,789 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 13 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2021-03-26 00:16:26,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 333 flow [2021-03-26 00:16:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:16:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:16:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2021-03-26 00:16:26,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8583724569640062 [2021-03-26 00:16:26,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1097 transitions. [2021-03-26 00:16:26,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1097 transitions. [2021-03-26 00:16:26,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:26,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1097 transitions. [2021-03-26 00:16:26,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,798 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:26,798 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 199 flow. Second operand 6 states and 1097 transitions. [2021-03-26 00:16:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 333 flow [2021-03-26 00:16:26,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:16:26,802 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 318 flow [2021-03-26 00:16:26,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2021-03-26 00:16:26,803 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2021-03-26 00:16:26,803 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:26,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 318 flow [2021-03-26 00:16:26,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 50 transitions, 318 flow [2021-03-26 00:16:26,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 318 flow [2021-03-26 00:16:26,925 INFO L129 PetriNetUnfolder]: 557/1220 cut-off events. [2021-03-26 00:16:26,926 INFO L130 PetriNetUnfolder]: For 3007/3824 co-relation queries the response was YES. [2021-03-26 00:16:26,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 1220 events. 557/1220 cut-off events. For 3007/3824 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 9358 event pairs, 119 based on Foata normal form. 36/1174 useless extension candidates. Maximal degree in co-relation 5111. Up to 859 conditions per place. [2021-03-26 00:16:26,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 944 [2021-03-26 00:16:27,464 INFO L154 LiptonReduction]: Checked pairs total: 1231 [2021-03-26 00:16:27,465 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:27,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 662 [2021-03-26 00:16:27,468 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 310 flow [2021-03-26 00:16:27,469 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 00:16:27,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:27,469 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:27,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:16:27,469 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 00:16:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1072346706, now seen corresponding path program 1 times [2021-03-26 00:16:27,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:27,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213174082] [2021-03-26 00:16:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:27,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:27,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:27,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:27,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:27,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213174082] [2021-03-26 00:16:27,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:27,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:16:27,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757486502] [2021-03-26 00:16:27,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:16:27,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:16:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:16:27,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 213 [2021-03-26 00:16:27,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:27,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:27,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 213 [2021-03-26 00:16:27,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:27,712 INFO L129 PetriNetUnfolder]: 567/1237 cut-off events. [2021-03-26 00:16:27,712 INFO L130 PetriNetUnfolder]: For 3261/3654 co-relation queries the response was YES. [2021-03-26 00:16:27,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5125 conditions, 1237 events. 567/1237 cut-off events. For 3261/3654 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 9129 event pairs, 157 based on Foata normal form. 83/1228 useless extension candidates. Maximal degree in co-relation 5102. Up to 820 conditions per place. [2021-03-26 00:16:27,723 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2021-03-26 00:16:27,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 288 flow [2021-03-26 00:16:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:16:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:16:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2021-03-26 00:16:27,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8826291079812206 [2021-03-26 00:16:27,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2021-03-26 00:16:27,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2021-03-26 00:16:27,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:27,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2021-03-26 00:16:27,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:27,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:27,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:27,732 INFO L185 Difference]: Start difference. First operand has 59 places, 49 transitions, 310 flow. Second operand 3 states and 564 transitions. [2021-03-26 00:16:27,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 288 flow [2021-03-26 00:16:27,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 250 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:16:27,754 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 252 flow [2021-03-26 00:16:27,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-26 00:16:27,755 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2021-03-26 00:16:27,755 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:27,755 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 252 flow [2021-03-26 00:16:27,755 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 252 flow [2021-03-26 00:16:27,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 252 flow [2021-03-26 00:16:27,856 INFO L129 PetriNetUnfolder]: 552/1204 cut-off events. [2021-03-26 00:16:27,856 INFO L130 PetriNetUnfolder]: For 1830/2008 co-relation queries the response was YES. [2021-03-26 00:16:27,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 1204 events. 552/1204 cut-off events. For 1830/2008 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 9004 event pairs, 154 based on Foata normal form. 40/1155 useless extension candidates. Maximal degree in co-relation 3768. Up to 755 conditions per place. [2021-03-26 00:16:27,872 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 00:16:27,994 INFO L154 LiptonReduction]: Checked pairs total: 550 [2021-03-26 00:16:27,994 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:27,994 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 239 [2021-03-26 00:16:27,995 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 252 flow [2021-03-26 00:16:27,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:27,995 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:27,995 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:27,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:16:27,996 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 00:16:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash -962967674, now seen corresponding path program 1 times [2021-03-26 00:16:27,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:27,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134279481] [2021-03-26 00:16:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:28,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:28,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:28,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:28,075 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:28,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:28,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:28,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134279481] [2021-03-26 00:16:28,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:28,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:16:28,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218398918] [2021-03-26 00:16:28,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:16:28,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:16:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:16:28,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 213 [2021-03-26 00:16:28,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 252 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 00:16:28,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:28,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 213 [2021-03-26 00:16:28,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:28,300 INFO L129 PetriNetUnfolder]: 752/1488 cut-off events. [2021-03-26 00:16:28,301 INFO L130 PetriNetUnfolder]: For 2370/3877 co-relation queries the response was YES. [2021-03-26 00:16:28,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 1488 events. 752/1488 cut-off events. For 2370/3877 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 10621 event pairs, 40 based on Foata normal form. 335/1639 useless extension candidates. Maximal degree in co-relation 5432. Up to 945 conditions per place. [2021-03-26 00:16:28,318 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 10 selfloop transitions, 18 changer transitions 4/61 dead transitions. [2021-03-26 00:16:28,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 424 flow [2021-03-26 00:16:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:16:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:16:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1280 transitions. [2021-03-26 00:16:28,322 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8584842387659289 [2021-03-26 00:16:28,322 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1280 transitions. [2021-03-26 00:16:28,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1280 transitions. [2021-03-26 00:16:28,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:28,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1280 transitions. [2021-03-26 00:16:28,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:28,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:28,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:28,330 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 252 flow. Second operand 7 states and 1280 transitions. [2021-03-26 00:16:28,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 424 flow [2021-03-26 00:16:28,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 416 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:16:28,336 INFO L241 Difference]: Finished difference. Result has 64 places, 54 transitions, 382 flow [2021-03-26 00:16:28,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=382, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2021-03-26 00:16:28,336 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2021-03-26 00:16:28,337 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:28,337 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 382 flow [2021-03-26 00:16:28,337 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 382 flow [2021-03-26 00:16:28,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 382 flow [2021-03-26 00:16:28,422 INFO L129 PetriNetUnfolder]: 365/902 cut-off events. [2021-03-26 00:16:28,422 INFO L130 PetriNetUnfolder]: For 2203/2358 co-relation queries the response was YES. [2021-03-26 00:16:28,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 902 events. 365/902 cut-off events. For 2203/2358 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6637 event pairs, 38 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 3797. Up to 598 conditions per place. [2021-03-26 00:16:28,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 00:16:28,726 INFO L154 LiptonReduction]: Checked pairs total: 1526 [2021-03-26 00:16:28,726 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:28,726 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 389 [2021-03-26 00:16:28,729 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 372 flow [2021-03-26 00:16:28,729 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 00:16:28,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:28,729 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 00:16:28,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:16:28,730 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 00:16:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1756831589, now seen corresponding path program 1 times [2021-03-26 00:16:28,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:28,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729811734] [2021-03-26 00:16:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:28,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:28,817 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-26 00:16:28,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 00:16:28,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:16:28,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:28,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:28,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729811734] [2021-03-26 00:16:28,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:28,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:28,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194221508] [2021-03-26 00:16:28,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:16:28,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:16:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:16:28,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2021-03-26 00:16:28,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:28,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:28,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2021-03-26 00:16:28,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:29,478 INFO L129 PetriNetUnfolder]: 1565/3330 cut-off events. [2021-03-26 00:16:29,478 INFO L130 PetriNetUnfolder]: For 6964/7613 co-relation queries the response was YES. [2021-03-26 00:16:29,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11930 conditions, 3330 events. 1565/3330 cut-off events. For 6964/7613 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 28079 event pairs, 199 based on Foata normal form. 10/3079 useless extension candidates. Maximal degree in co-relation 11905. Up to 1503 conditions per place. [2021-03-26 00:16:29,514 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 18 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2021-03-26 00:16:29,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 478 flow [2021-03-26 00:16:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:16:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:16:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1157 transitions. [2021-03-26 00:16:29,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7759892689470155 [2021-03-26 00:16:29,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1157 transitions. [2021-03-26 00:16:29,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1157 transitions. [2021-03-26 00:16:29,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:29,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1157 transitions. [2021-03-26 00:16:29,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.28571428571428) internal successors, (1157), 7 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:29,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:29,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:29,524 INFO L185 Difference]: Start difference. First operand has 64 places, 53 transitions, 372 flow. Second operand 7 states and 1157 transitions. [2021-03-26 00:16:29,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 478 flow [2021-03-26 00:16:29,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 421 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-26 00:16:29,650 INFO L241 Difference]: Finished difference. Result has 67 places, 64 transitions, 389 flow [2021-03-26 00:16:29,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2021-03-26 00:16:29,650 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2021-03-26 00:16:29,650 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:29,650 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 64 transitions, 389 flow [2021-03-26 00:16:29,650 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 64 transitions, 389 flow [2021-03-26 00:16:29,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 64 transitions, 389 flow [2021-03-26 00:16:29,914 INFO L129 PetriNetUnfolder]: 1122/2460 cut-off events. [2021-03-26 00:16:29,914 INFO L130 PetriNetUnfolder]: For 3274/3363 co-relation queries the response was YES. [2021-03-26 00:16:29,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 2460 events. 1122/2460 cut-off events. For 3274/3363 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 20542 event pairs, 103 based on Foata normal form. 1/2274 useless extension candidates. Maximal degree in co-relation 7964. Up to 953 conditions per place. [2021-03-26 00:16:29,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 1158 [2021-03-26 00:16:30,660 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:30,776 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:31,109 INFO L154 LiptonReduction]: Checked pairs total: 261 [2021-03-26 00:16:31,109 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:31,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1459 [2021-03-26 00:16:31,110 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 395 flow [2021-03-26 00:16:31,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:31,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:31,111 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 00:16:31,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:16:31,111 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 00:16:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash 632770868, now seen corresponding path program 1 times [2021-03-26 00:16:31,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:31,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855007078] [2021-03-26 00:16:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:31,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:31,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:31,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:31,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:31,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:31,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:31,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:31,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:31,209 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:31,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:31,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:31,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:31,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855007078] [2021-03-26 00:16:31,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:31,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:16:31,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121448454] [2021-03-26 00:16:31,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:16:31,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:16:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:16:31,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2021-03-26 00:16:31,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 395 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 00:16:31,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:31,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2021-03-26 00:16:31,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:31,760 INFO L129 PetriNetUnfolder]: 2309/4265 cut-off events. [2021-03-26 00:16:31,760 INFO L130 PetriNetUnfolder]: For 6171/9832 co-relation queries the response was YES. [2021-03-26 00:16:31,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15548 conditions, 4265 events. 2309/4265 cut-off events. For 6171/9832 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 34158 event pairs, 92 based on Foata normal form. 695/4287 useless extension candidates. Maximal degree in co-relation 15521. Up to 1617 conditions per place. [2021-03-26 00:16:31,811 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 6 selfloop transitions, 18 changer transitions 8/72 dead transitions. [2021-03-26 00:16:31,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 502 flow [2021-03-26 00:16:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:16:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:16:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1456 transitions. [2021-03-26 00:16:31,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8504672897196262 [2021-03-26 00:16:31,815 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1456 transitions. [2021-03-26 00:16:31,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1456 transitions. [2021-03-26 00:16:31,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:31,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1456 transitions. [2021-03-26 00:16:31,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:31,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:31,823 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:31,823 INFO L185 Difference]: Start difference. First operand has 67 places, 64 transitions, 395 flow. Second operand 8 states and 1456 transitions. [2021-03-26 00:16:31,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 502 flow [2021-03-26 00:16:31,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 479 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:31,973 INFO L241 Difference]: Finished difference. Result has 75 places, 61 transitions, 407 flow [2021-03-26 00:16:31,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2021-03-26 00:16:31,974 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2021-03-26 00:16:31,974 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:31,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 61 transitions, 407 flow [2021-03-26 00:16:31,974 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 61 transitions, 407 flow [2021-03-26 00:16:31,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 61 transitions, 407 flow [2021-03-26 00:16:32,136 INFO L129 PetriNetUnfolder]: 914/2116 cut-off events. [2021-03-26 00:16:32,136 INFO L130 PetriNetUnfolder]: For 4018/4350 co-relation queries the response was YES. [2021-03-26 00:16:32,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8220 conditions, 2116 events. 914/2116 cut-off events. For 4018/4350 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 18023 event pairs, 52 based on Foata normal form. 1/1937 useless extension candidates. Maximal degree in co-relation 8192. Up to 821 conditions per place. [2021-03-26 00:16:32,176 INFO L142 LiptonReduction]: Number of co-enabled transitions 1072 [2021-03-26 00:16:32,631 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:32,756 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:33,146 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:16:33,300 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:16:33,437 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:16:33,566 INFO L154 LiptonReduction]: Checked pairs total: 228 [2021-03-26 00:16:33,566 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:16:33,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1592 [2021-03-26 00:16:33,567 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 391 flow [2021-03-26 00:16:33,567 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 00:16:33,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:33,568 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 00:16:33,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:16:33,568 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 00:16:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -438454613, now seen corresponding path program 1 times [2021-03-26 00:16:33,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:33,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466198600] [2021-03-26 00:16:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:33,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:33,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:33,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:33,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:33,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:33,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:33,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466198600] [2021-03-26 00:16:33,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:33,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:33,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851637056] [2021-03-26 00:16:33,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:33,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:33,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 216 [2021-03-26 00:16:33,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:33,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:33,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 216 [2021-03-26 00:16:33,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:33,943 INFO L129 PetriNetUnfolder]: 1536/3322 cut-off events. [2021-03-26 00:16:33,943 INFO L130 PetriNetUnfolder]: For 12562/13354 co-relation queries the response was YES. [2021-03-26 00:16:33,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12510 conditions, 3322 events. 1536/3322 cut-off events. For 12562/13354 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 29894 event pairs, 124 based on Foata normal form. 65/3053 useless extension candidates. Maximal degree in co-relation 12480. Up to 1196 conditions per place. [2021-03-26 00:16:33,967 INFO L132 encePairwiseOnDemand]: 213/216 looper letters, 3 selfloop transitions, 1 changer transitions 14/60 dead transitions. [2021-03-26 00:16:33,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 60 transitions, 415 flow [2021-03-26 00:16:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:16:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:16:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2021-03-26 00:16:33,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8495370370370371 [2021-03-26 00:16:33,969 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2021-03-26 00:16:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2021-03-26 00:16:33,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:33,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2021-03-26 00:16:33,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:33,973 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 00:16:33,973 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 00:16:33,973 INFO L185 Difference]: Start difference. First operand has 71 places, 58 transitions, 391 flow. Second operand 4 states and 734 transitions. [2021-03-26 00:16:33,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 60 transitions, 415 flow [2021-03-26 00:16:34,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 350 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-26 00:16:34,174 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 255 flow [2021-03-26 00:16:34,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2021-03-26 00:16:34,174 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2021-03-26 00:16:34,174 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:34,174 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 46 transitions, 255 flow [2021-03-26 00:16:34,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 46 transitions, 255 flow [2021-03-26 00:16:34,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 255 flow [2021-03-26 00:16:34,215 INFO L129 PetriNetUnfolder]: 199/510 cut-off events. [2021-03-26 00:16:34,215 INFO L130 PetriNetUnfolder]: For 1311/1389 co-relation queries the response was YES. [2021-03-26 00:16:34,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 510 events. 199/510 cut-off events. For 1311/1389 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3399 event pairs, 12 based on Foata normal form. 13/475 useless extension candidates. Maximal degree in co-relation 1499. Up to 168 conditions per place. [2021-03-26 00:16:34,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-26 00:16:34,290 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 00:16:34,290 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:34,290 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-03-26 00:16:34,291 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 258 flow [2021-03-26 00:16:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:34,292 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:34,292 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 00:16:34,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:16:34,292 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 00:16:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash 806139394, now seen corresponding path program 1 times [2021-03-26 00:16:34,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:34,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572806350] [2021-03-26 00:16:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:34,372 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:34,459 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:34,506 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:16:34,506 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:16:34,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:16:34,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:16:34 BasicIcfg [2021-03-26 00:16:34,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:16:34,645 INFO L168 Benchmark]: Toolchain (without parser) took 20059.85 ms. Allocated memory was 255.9 MB in the beginning and 845.2 MB in the end (delta: 589.3 MB). Free memory was 233.9 MB in the beginning and 746.3 MB in the end (delta: -512.4 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,645 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 154.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:16:34,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.45 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.7 MB in the beginning and 325.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.92 ms. Allocated memory is still 367.0 MB. Free memory was 325.6 MB in the beginning and 322.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,645 INFO L168 Benchmark]: Boogie Preprocessor took 57.57 ms. Allocated memory is still 367.0 MB. Free memory was 322.9 MB in the beginning and 320.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,646 INFO L168 Benchmark]: RCFGBuilder took 2039.71 ms. Allocated memory is still 367.0 MB. Free memory was 320.8 MB in the beginning and 271.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,646 INFO L168 Benchmark]: TraceAbstraction took 17392.96 ms. Allocated memory was 367.0 MB in the beginning and 845.2 MB in the end (delta: 478.2 MB). Free memory was 270.3 MB in the beginning and 746.3 MB in the end (delta: -476.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:34,647 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 was 237.8 MB in the beginning and 237.7 MB in the end (delta: 154.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 494.45 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.7 MB in the beginning and 325.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 67.92 ms. Allocated memory is still 367.0 MB. Free memory was 325.6 MB in the beginning and 322.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.57 ms. Allocated memory is still 367.0 MB. Free memory was 322.9 MB in the beginning and 320.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2039.71 ms. Allocated memory is still 367.0 MB. Free memory was 320.8 MB in the beginning and 271.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17392.96 ms. Allocated memory was 367.0 MB in the beginning and 845.2 MB in the end (delta: 478.2 MB). Free memory was 270.3 MB in the beginning and 746.3 MB in the end (delta: -476.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3746.8ms, 127 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2639, positive: 2528, positive conditional: 2528, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1911, positive: 1858, positive conditional: 0, positive unconditional: 1858, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1911, positive: 1858, positive conditional: 0, positive unconditional: 1858, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1911, positive: 1841, positive conditional: 0, positive unconditional: 1841, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 792, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 741, negative conditional: 0, negative unconditional: 741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2639, positive: 670, positive conditional: 670, positive unconditional: 0, negative: 58, negative conditional: 58, negative unconditional: 0, unknown: 1911, unknown conditional: 1911, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 137, Positive conditional cache size: 137, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1161.6ms, 57 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 34 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2761 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 968, positive: 844, positive conditional: 844, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 253, positive: 231, positive conditional: 20, positive unconditional: 211, negative: 22, negative conditional: 1, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 253, positive: 231, positive conditional: 20, positive unconditional: 211, negative: 22, negative conditional: 1, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 253, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 22, negative conditional: 1, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 220, negative conditional: 19, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 968, positive: 613, positive conditional: 613, positive unconditional: 0, negative: 102, negative conditional: 102, negative unconditional: 0, unknown: 253, unknown conditional: 253, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 737.9ms, 49 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 31 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1422 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 587, positive: 516, positive conditional: 516, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 81, positive conditional: 23, positive unconditional: 58, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, positive: 81, positive conditional: 23, positive unconditional: 58, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 587, positive: 435, positive conditional: 435, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 252, Positive conditional cache size: 252, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1135.7ms, 46 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 178, positive conditional: 178, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 6, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 6, positive unconditional: 10, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 216, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 268, Positive conditional cache size: 268, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 378.4ms, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, 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: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 263, Positive conditional cache size: 263, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 431.0ms, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 267, Positive conditional cache size: 267, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 661.6ms, 59 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1231 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 22, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 22, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 269, Positive conditional cache size: 269, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 238.8ms, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 56, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 273, Positive conditional cache size: 273, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 389.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 204, positive conditional: 204, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 39, 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: 39, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 248, positive: 165, positive conditional: 165, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 292, Positive conditional cache size: 292, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1458.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 24, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 24, positive unconditional: 8, 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: 34, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 312, Positive conditional cache size: 312, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1591.8ms, 75 PlacesBefore, 71 PlacesAfterwards, 61 TransitionsBefore, 58 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 26, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 49, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 273, Positive conditional cache size: 273, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.6ms, 67 PlacesBefore, 64 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 18, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 18, 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: 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: 36, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 263, Positive conditional cache size: 263, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t977; [L872] FCALL, FORK 0 pthread_create(&t977, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t978; [L874] FCALL, FORK 0 pthread_create(&t978, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t979; [L876] FCALL, FORK 0 pthread_create(&t979, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t980; [L878] FCALL, FORK 0 pthread_create(&t980, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17107.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3589.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3820.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 51 SDslu, 32 SDs, 0 SdLazy, 283 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 313.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 174.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=10, InterpolantAutomatonStates: 56, 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: 44.7ms SsaConstructionTime, 406.3ms SatisfiabilityAnalysisTime, 590.2ms InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...