/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:28:40,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:28:40,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:28:40,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:28:40,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:28:40,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:28:40,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:28:40,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:28:40,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:28:40,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:28:40,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:28:40,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:28:40,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:28:40,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:28:40,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:28:40,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:28:40,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:28:40,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:28:40,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:28:40,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:28:40,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:28:40,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:28:40,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:28:40,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:28:40,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:28:40,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:28:40,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:28:40,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:28:40,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:28:40,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:28:40,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:28:40,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:28:40,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:28:40,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:28:40,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:28:40,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:28:40,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:28:40,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:28:40,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:28:40,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:28:40,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:28:40,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:28:40,237 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:28:40,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:28:40,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:28:40,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:28:40,240 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:28:40,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:28:40,240 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:28:40,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:28:40,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:28:40,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:28:40,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:28:40,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:28:40,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:28:40,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:28:40,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:28:40,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:28:40,244 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:28:40,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:28:40,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:28:40,244 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-06-11 15:28:40,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:28:40,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:28:40,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:28:40,576 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:28:40,576 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:28:40,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2021-06-11 15:28:40,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca36eb38/d805a594d8804884973c96c7bd03d54a/FLAG6bd83a497 [2021-06-11 15:28:41,230 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:28:41,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2021-06-11 15:28:41,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca36eb38/d805a594d8804884973c96c7bd03d54a/FLAG6bd83a497 [2021-06-11 15:28:41,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca36eb38/d805a594d8804884973c96c7bd03d54a [2021-06-11 15:28:41,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:28:41,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:28:41,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:28:41,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:28:41,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:28:41,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:28:41" (1/1) ... [2021-06-11 15:28:41,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41385188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:41, skipping insertion in model container [2021-06-11 15:28:41,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:28:41" (1/1) ... [2021-06-11 15:28:41,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:28:41,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:28:41,837 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/mix001_power.opt.i[950,963] [2021-06-11 15:28:42,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:28:42,048 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:28:42,057 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/mix001_power.opt.i[950,963] [2021-06-11 15:28:42,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:28:42,150 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:28:42,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42 WrapperNode [2021-06-11 15:28:42,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:28:42,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:28:42,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:28:42,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:28:42,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:28:42,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:28:42,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:28:42,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:28:42,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (1/1) ... [2021-06-11 15:28:42,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:28:42,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:28:42,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:28:42,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:28:42,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (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-06-11 15:28:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:28:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:28:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:28:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:28:42,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:28:42,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:28:42,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:28:42,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:28:42,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:28:42,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:28:42,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:28:42,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:28:42,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:28:42,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:28:42,328 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:28:44,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:28:44,425 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:28:44,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:28:44 BoogieIcfgContainer [2021-06-11 15:28:44,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:28:44,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:28:44,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:28:44,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:28:44,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:28:41" (1/3) ... [2021-06-11 15:28:44,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205513ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:28:44, skipping insertion in model container [2021-06-11 15:28:44,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:28:42" (2/3) ... [2021-06-11 15:28:44,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205513ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:28:44, skipping insertion in model container [2021-06-11 15:28:44,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:28:44" (3/3) ... [2021-06-11 15:28:44,433 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2021-06-11 15:28:44,438 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:28:44,442 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:28:44,443 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:28:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:28:44,523 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:28:44,540 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:28:44,557 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:28:44,557 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:28:44,558 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:28:44,558 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:28:44,558 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:28:44,558 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:28:44,558 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:28:44,558 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:28:44,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 15:28:44,635 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 15:28:44,635 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:44,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:28:44,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 15:28:44,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-06-11 15:28:44,653 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:44,668 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 15:28:44,673 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 15:28:44,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-06-11 15:28:44,715 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 15:28:44,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:44,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:28:44,721 INFO L151 LiptonReduction]: Number of co-enabled transitions 1760 [2021-06-11 15:28:44,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:44,972 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:28:44,972 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:44,998 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:45,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:45,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:45,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:45,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:45,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:45,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:45,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:45,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:45,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:45,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:45,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,147 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:28:46,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,806 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:46,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:46,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:46,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:46,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:46,987 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:28:47,370 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:28:47,507 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:28:47,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:47,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:28:47,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:47,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,547 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:28:47,547 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:47,550 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,552 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:28:47,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:47,554 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:28:47,555 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:28:47,555 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:47,557 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,559 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 15:28:47,560 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:28:47,560 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:47,562 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,567 INFO L147 QuantifierPusher]: treesize reduction 189, result has 28.4 percent of original size 75 [2021-06-11 15:28:47,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:47,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:48,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:48,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:48,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,283 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:28:48,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:48,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:48,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:49,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:49,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:49,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:49,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:28:49,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:49,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:28:49,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:28:49,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:28:49,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:28:49,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:49,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:49,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:49,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:50,267 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:28:50,433 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:28:50,820 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:28:50,961 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:28:50,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:50,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:50,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:50,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:28:50,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:28:50,989 INFO L163 LiptonReduction]: Checked pairs total: 5543 [2021-06-11 15:28:50,989 INFO L165 LiptonReduction]: Total number of compositions: 94 [2021-06-11 15:28:50,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6340 [2021-06-11 15:28:51,005 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-06-11 15:28:51,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:51,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:51,006 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:51,006 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash -689221389, now seen corresponding path program 1 times [2021-06-11 15:28:51,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:51,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965431599] [2021-06-11 15:28:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:51,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:51,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:51,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965431599] [2021-06-11 15:28:51,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:51,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:28:51,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179919768] [2021-06-11 15:28:51,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:28:51,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:51,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:28:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:28:51,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2021-06-11 15:28:51,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:51,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2021-06-11 15:28:51,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:51,253 INFO L129 PetriNetUnfolder]: 13/62 cut-off events. [2021-06-11 15:28:51,253 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:51,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 62 events. 13/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 203 event pairs, 5 based on Foata normal form. 16/69 useless extension candidates. Maximal degree in co-relation 92. Up to 25 conditions per place. [2021-06-11 15:28:51,255 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 6 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-11 15:28:51,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 77 flow [2021-06-11 15:28:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:28:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:28:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-06-11 15:28:51,273 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494077834179357 [2021-06-11 15:28:51,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-06-11 15:28:51,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-06-11 15:28:51,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:51,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-06-11 15:28:51,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,294 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 502 transitions. [2021-06-11 15:28:51,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 77 flow [2021-06-11 15:28:51,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:28:51,297 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2021-06-11 15:28:51,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-06-11 15:28:51,300 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 15:28:51,300 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:51,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 15:28:51,301 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 15:28:51,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2021-06-11 15:28:51,306 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-06-11 15:28:51,306 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:51,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:28:51,307 INFO L151 LiptonReduction]: Number of co-enabled transitions 290 [2021-06-11 15:28:51,320 INFO L163 LiptonReduction]: Checked pairs total: 360 [2021-06-11 15:28:51,320 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:51,320 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 15:28:51,322 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-06-11 15:28:51,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:51,323 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:51,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:28:51,323 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash -916696991, now seen corresponding path program 1 times [2021-06-11 15:28:51,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:51,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089103427] [2021-06-11 15:28:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:51,473 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 15:28:51,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 15:28:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:51,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089103427] [2021-06-11 15:28:51,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:51,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:28:51,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923439225] [2021-06-11 15:28:51,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:28:51,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:28:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:28:51,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2021-06-11 15:28:51,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:51,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2021-06-11 15:28:51,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:51,601 INFO L129 PetriNetUnfolder]: 158/347 cut-off events. [2021-06-11 15:28:51,601 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:51,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 347 events. 158/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1929 event pairs, 77 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 613. Up to 237 conditions per place. [2021-06-11 15:28:51,605 INFO L132 encePairwiseOnDemand]: 188/197 looper letters, 7 selfloop transitions, 4 changer transitions 5/31 dead transitions. [2021-06-11 15:28:51,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 104 flow [2021-06-11 15:28:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:28:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:28:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2021-06-11 15:28:51,607 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8003384094754653 [2021-06-11 15:28:51,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2021-06-11 15:28:51,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2021-06-11 15:28:51,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:51,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2021-06-11 15:28:51,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,611 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 473 transitions. [2021-06-11 15:28:51,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 104 flow [2021-06-11 15:28:51,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:28:51,612 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 84 flow [2021-06-11 15:28:51,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-06-11 15:28:51,613 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-06-11 15:28:51,613 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:51,614 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 84 flow [2021-06-11 15:28:51,614 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 84 flow [2021-06-11 15:28:51,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 84 flow [2021-06-11 15:28:51,638 INFO L129 PetriNetUnfolder]: 79/183 cut-off events. [2021-06-11 15:28:51,638 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:28:51,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 183 events. 79/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 841 event pairs, 59 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 319. Up to 132 conditions per place. [2021-06-11 15:28:51,641 INFO L151 LiptonReduction]: Number of co-enabled transitions 266 [2021-06-11 15:28:51,644 INFO L163 LiptonReduction]: Checked pairs total: 172 [2021-06-11 15:28:51,644 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:51,645 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 15:28:51,648 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2021-06-11 15:28:51,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,648 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:51,649 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:51,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:28:51,649 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -477522081, now seen corresponding path program 1 times [2021-06-11 15:28:51,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:51,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477907948] [2021-06-11 15:28:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:51,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:51,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:51,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477907948] [2021-06-11 15:28:51,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:51,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:28:51,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534423822] [2021-06-11 15:28:51,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:28:51,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:28:51,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:28:51,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 197 [2021-06-11 15:28:51,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:51,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 197 [2021-06-11 15:28:51,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:51,798 INFO L129 PetriNetUnfolder]: 61/152 cut-off events. [2021-06-11 15:28:51,799 INFO L130 PetriNetUnfolder]: For 33/45 co-relation queries the response was YES. [2021-06-11 15:28:51,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 152 events. 61/152 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 698 event pairs, 45 based on Foata normal form. 6/152 useless extension candidates. Maximal degree in co-relation 289. Up to 106 conditions per place. [2021-06-11 15:28:51,800 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-06-11 15:28:51,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 92 flow [2021-06-11 15:28:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:28:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:28:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2021-06-11 15:28:51,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8544839255499154 [2021-06-11 15:28:51,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2021-06-11 15:28:51,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2021-06-11 15:28:51,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:51,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2021-06-11 15:28:51,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,806 INFO L185 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 3 states and 505 transitions. [2021-06-11 15:28:51,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 92 flow [2021-06-11 15:28:51,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:28:51,808 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 91 flow [2021-06-11 15:28:51,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-06-11 15:28:51,808 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2021-06-11 15:28:51,808 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:51,808 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 91 flow [2021-06-11 15:28:51,809 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 91 flow [2021-06-11 15:28:51,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 91 flow [2021-06-11 15:28:51,832 INFO L129 PetriNetUnfolder]: 61/152 cut-off events. [2021-06-11 15:28:51,832 INFO L130 PetriNetUnfolder]: For 24/26 co-relation queries the response was YES. [2021-06-11 15:28:51,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 152 events. 61/152 cut-off events. For 24/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 672 event pairs, 43 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 295. Up to 106 conditions per place. [2021-06-11 15:28:51,834 INFO L151 LiptonReduction]: Number of co-enabled transitions 264 [2021-06-11 15:28:51,836 INFO L163 LiptonReduction]: Checked pairs total: 170 [2021-06-11 15:28:51,837 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:51,837 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 15:28:51,838 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 91 flow [2021-06-11 15:28:51,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:51,839 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:51,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:28:51,839 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -465700622, now seen corresponding path program 1 times [2021-06-11 15:28:51,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:51,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032493687] [2021-06-11 15:28:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:51,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:51,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:51,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032493687] [2021-06-11 15:28:51,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:51,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:28:51,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404411597] [2021-06-11 15:28:51,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:28:51,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:28:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:28:51,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 197 [2021-06-11 15:28:51,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:51,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 197 [2021-06-11 15:28:51,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:51,953 INFO L129 PetriNetUnfolder]: 48/125 cut-off events. [2021-06-11 15:28:51,953 INFO L130 PetriNetUnfolder]: For 76/91 co-relation queries the response was YES. [2021-06-11 15:28:51,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 125 events. 48/125 cut-off events. For 76/91 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 34 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 264. Up to 87 conditions per place. [2021-06-11 15:28:51,954 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-06-11 15:28:51,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 99 flow [2021-06-11 15:28:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:28:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:28:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-06-11 15:28:51,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8595600676818951 [2021-06-11 15:28:51,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-06-11 15:28:51,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-06-11 15:28:51,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:51,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-06-11 15:28:51,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,959 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 91 flow. Second operand 3 states and 508 transitions. [2021-06-11 15:28:51,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 99 flow [2021-06-11 15:28:51,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 93 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:28:51,960 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 96 flow [2021-06-11 15:28:51,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-06-11 15:28:51,961 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2021-06-11 15:28:51,961 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:51,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 96 flow [2021-06-11 15:28:51,961 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 96 flow [2021-06-11 15:28:51,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 96 flow [2021-06-11 15:28:51,981 INFO L129 PetriNetUnfolder]: 48/127 cut-off events. [2021-06-11 15:28:51,981 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-11 15:28:51,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 127 events. 48/127 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 34 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 266. Up to 87 conditions per place. [2021-06-11 15:28:51,982 INFO L151 LiptonReduction]: Number of co-enabled transitions 262 [2021-06-11 15:28:51,987 INFO L163 LiptonReduction]: Checked pairs total: 168 [2021-06-11 15:28:51,987 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:51,987 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-06-11 15:28:51,989 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 96 flow [2021-06-11 15:28:51,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:51,989 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:51,989 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:51,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:28:51,990 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -919296417, now seen corresponding path program 1 times [2021-06-11 15:28:51,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:51,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445299891] [2021-06-11 15:28:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:52,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,065 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 15:28:52,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 15:28:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:52,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445299891] [2021-06-11 15:28:52,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:52,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:28:52,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553439802] [2021-06-11 15:28:52,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:28:52,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:52,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:28:52,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:28:52,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2021-06-11 15:28:52,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:52,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2021-06-11 15:28:52,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:52,124 INFO L129 PetriNetUnfolder]: 40/113 cut-off events. [2021-06-11 15:28:52,124 INFO L130 PetriNetUnfolder]: For 60/125 co-relation queries the response was YES. [2021-06-11 15:28:52,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 113 events. 40/113 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 451 event pairs, 30 based on Foata normal form. 9/119 useless extension candidates. Maximal degree in co-relation 306. Up to 75 conditions per place. [2021-06-11 15:28:52,125 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 12 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-06-11 15:28:52,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 146 flow [2021-06-11 15:28:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:28:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:28:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-06-11 15:28:52,127 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7935702199661591 [2021-06-11 15:28:52,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-06-11 15:28:52,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-06-11 15:28:52,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:52,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-06-11 15:28:52,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,130 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 96 flow. Second operand 3 states and 469 transitions. [2021-06-11 15:28:52,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 146 flow [2021-06-11 15:28:52,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:28:52,132 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 101 flow [2021-06-11 15:28:52,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-06-11 15:28:52,132 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-06-11 15:28:52,132 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:52,132 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 101 flow [2021-06-11 15:28:52,133 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 101 flow [2021-06-11 15:28:52,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 101 flow [2021-06-11 15:28:52,145 INFO L129 PetriNetUnfolder]: 40/105 cut-off events. [2021-06-11 15:28:52,145 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-11 15:28:52,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 105 events. 40/105 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 379 event pairs, 30 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 241. Up to 75 conditions per place. [2021-06-11 15:28:52,147 INFO L151 LiptonReduction]: Number of co-enabled transitions 260 [2021-06-11 15:28:52,149 INFO L163 LiptonReduction]: Checked pairs total: 166 [2021-06-11 15:28:52,149 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:52,149 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 15:28:52,150 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 101 flow [2021-06-11 15:28:52,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:52,150 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:52,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:28:52,151 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1903308345, now seen corresponding path program 1 times [2021-06-11 15:28:52,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:52,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99622298] [2021-06-11 15:28:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:52,254 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:28:52,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:28:52,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:52,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99622298] [2021-06-11 15:28:52,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:52,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:28:52,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987546583] [2021-06-11 15:28:52,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:28:52,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:52,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:28:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:28:52,264 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-06-11 15:28:52,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:52,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-06-11 15:28:52,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:52,331 INFO L129 PetriNetUnfolder]: 135/367 cut-off events. [2021-06-11 15:28:52,332 INFO L130 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2021-06-11 15:28:52,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 367 events. 135/367 cut-off events. For 131/133 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2307 event pairs, 59 based on Foata normal form. 28/317 useless extension candidates. Maximal degree in co-relation 806. Up to 137 conditions per place. [2021-06-11 15:28:52,334 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 8 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2021-06-11 15:28:52,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 159 flow [2021-06-11 15:28:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:28:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:28:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 795 transitions. [2021-06-11 15:28:52,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8071065989847716 [2021-06-11 15:28:52,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 795 transitions. [2021-06-11 15:28:52,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 795 transitions. [2021-06-11 15:28:52,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:52,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 795 transitions. [2021-06-11 15:28:52,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,341 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 101 flow. Second operand 5 states and 795 transitions. [2021-06-11 15:28:52,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 159 flow [2021-06-11 15:28:52,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:28:52,343 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 164 flow [2021-06-11 15:28:52,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2021-06-11 15:28:52,344 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-06-11 15:28:52,344 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:52,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 164 flow [2021-06-11 15:28:52,344 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 164 flow [2021-06-11 15:28:52,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 164 flow [2021-06-11 15:28:52,375 INFO L129 PetriNetUnfolder]: 135/349 cut-off events. [2021-06-11 15:28:52,376 INFO L130 PetriNetUnfolder]: For 320/389 co-relation queries the response was YES. [2021-06-11 15:28:52,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 349 events. 135/349 cut-off events. For 320/389 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2240 event pairs, 56 based on Foata normal form. 10/315 useless extension candidates. Maximal degree in co-relation 972. Up to 181 conditions per place. [2021-06-11 15:28:52,380 INFO L151 LiptonReduction]: Number of co-enabled transitions 358 [2021-06-11 15:28:52,421 INFO L163 LiptonReduction]: Checked pairs total: 184 [2021-06-11 15:28:52,421 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:52,421 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77 [2021-06-11 15:28:52,421 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 164 flow [2021-06-11 15:28:52,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:52,422 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:52,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:28:52,422 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2131250327, now seen corresponding path program 1 times [2021-06-11 15:28:52,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:52,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713419325] [2021-06-11 15:28:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:52,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,514 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:28:52,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:28:52,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:52,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713419325] [2021-06-11 15:28:52,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:52,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:28:52,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120007229] [2021-06-11 15:28:52,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:28:52,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:28:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:28:52,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-06-11 15:28:52,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:52,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-06-11 15:28:52,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:52,614 INFO L129 PetriNetUnfolder]: 97/304 cut-off events. [2021-06-11 15:28:52,614 INFO L130 PetriNetUnfolder]: For 443/1032 co-relation queries the response was YES. [2021-06-11 15:28:52,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 304 events. 97/304 cut-off events. For 443/1032 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1879 event pairs, 24 based on Foata normal form. 113/379 useless extension candidates. Maximal degree in co-relation 1027. Up to 148 conditions per place. [2021-06-11 15:28:52,617 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 5 selfloop transitions, 21 changer transitions 3/48 dead transitions. [2021-06-11 15:28:52,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 303 flow [2021-06-11 15:28:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:28:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:28:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1113 transitions. [2021-06-11 15:28:52,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8071065989847716 [2021-06-11 15:28:52,620 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1113 transitions. [2021-06-11 15:28:52,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1113 transitions. [2021-06-11 15:28:52,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:52,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1113 transitions. [2021-06-11 15:28:52,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,625 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,625 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 164 flow. Second operand 7 states and 1113 transitions. [2021-06-11 15:28:52,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 303 flow [2021-06-11 15:28:52,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:28:52,629 INFO L241 Difference]: Finished difference. Result has 51 places, 45 transitions, 307 flow [2021-06-11 15:28:52,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2021-06-11 15:28:52,629 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2021-06-11 15:28:52,629 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:52,629 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 307 flow [2021-06-11 15:28:52,629 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 307 flow [2021-06-11 15:28:52,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 307 flow [2021-06-11 15:28:52,656 INFO L129 PetriNetUnfolder]: 90/282 cut-off events. [2021-06-11 15:28:52,657 INFO L130 PetriNetUnfolder]: For 820/1033 co-relation queries the response was YES. [2021-06-11 15:28:52,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 282 events. 90/282 cut-off events. For 820/1033 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1758 event pairs, 24 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 1091. Up to 137 conditions per place. [2021-06-11 15:28:52,661 INFO L151 LiptonReduction]: Number of co-enabled transitions 478 [2021-06-11 15:28:52,697 INFO L163 LiptonReduction]: Checked pairs total: 310 [2021-06-11 15:28:52,697 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:52,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-06-11 15:28:52,698 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 307 flow [2021-06-11 15:28:52,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:52,698 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-06-11 15:28:52,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:28:52,699 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 402782355, now seen corresponding path program 1 times [2021-06-11 15:28:52,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:52,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944234533] [2021-06-11 15:28:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:52,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,778 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:28:52,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:28:52,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:52,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:52,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:52,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944234533] [2021-06-11 15:28:52,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:52,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:28:52,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763046990] [2021-06-11 15:28:52,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:28:52,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:28:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:28:52,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-06-11 15:28:52,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:52,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-06-11 15:28:52,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:52,924 INFO L129 PetriNetUnfolder]: 82/273 cut-off events. [2021-06-11 15:28:52,924 INFO L130 PetriNetUnfolder]: For 1269/2325 co-relation queries the response was YES. [2021-06-11 15:28:52,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 273 events. 82/273 cut-off events. For 1269/2325 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1717 event pairs, 18 based on Foata normal form. 132/368 useless extension candidates. Maximal degree in co-relation 1226. Up to 127 conditions per place. [2021-06-11 15:28:52,927 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 2 selfloop transitions, 25 changer transitions 7/53 dead transitions. [2021-06-11 15:28:52,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 443 flow [2021-06-11 15:28:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:28:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:28:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1425 transitions. [2021-06-11 15:28:52,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8037225042301185 [2021-06-11 15:28:52,932 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1425 transitions. [2021-06-11 15:28:52,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1425 transitions. [2021-06-11 15:28:52,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:52,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1425 transitions. [2021-06-11 15:28:52,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 158.33333333333334) internal successors, (1425), 9 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,940 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,940 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 307 flow. Second operand 9 states and 1425 transitions. [2021-06-11 15:28:52,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 443 flow [2021-06-11 15:28:52,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 393 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-06-11 15:28:52,949 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 336 flow [2021-06-11 15:28:52,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-06-11 15:28:52,949 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-06-11 15:28:52,949 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:52,950 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 336 flow [2021-06-11 15:28:52,950 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 336 flow [2021-06-11 15:28:52,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 46 transitions, 336 flow [2021-06-11 15:28:52,974 INFO L129 PetriNetUnfolder]: 78/266 cut-off events. [2021-06-11 15:28:52,975 INFO L130 PetriNetUnfolder]: For 911/985 co-relation queries the response was YES. [2021-06-11 15:28:52,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 266 events. 78/266 cut-off events. For 911/985 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1776 event pairs, 18 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 1080. Up to 107 conditions per place. [2021-06-11 15:28:52,979 INFO L151 LiptonReduction]: Number of co-enabled transitions 450 [2021-06-11 15:28:52,986 INFO L163 LiptonReduction]: Checked pairs total: 292 [2021-06-11 15:28:52,986 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:52,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-06-11 15:28:52,988 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 336 flow [2021-06-11 15:28:52,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:52,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:52,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:52,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:28:52,990 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1469462197, now seen corresponding path program 1 times [2021-06-11 15:28:52,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:52,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092215] [2021-06-11 15:28:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:53,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:53,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,060 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 15:28:53,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 15:28:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:53,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64092215] [2021-06-11 15:28:53,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:53,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:28:53,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344928400] [2021-06-11 15:28:53,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:28:53,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:28:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:28:53,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 197 [2021-06-11 15:28:53,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:53,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 197 [2021-06-11 15:28:53,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:53,165 INFO L129 PetriNetUnfolder]: 131/423 cut-off events. [2021-06-11 15:28:53,166 INFO L130 PetriNetUnfolder]: For 1716/2204 co-relation queries the response was YES. [2021-06-11 15:28:53,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 423 events. 131/423 cut-off events. For 1716/2204 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2985 event pairs, 14 based on Foata normal form. 8/381 useless extension candidates. Maximal degree in co-relation 1805. Up to 175 conditions per place. [2021-06-11 15:28:53,170 INFO L132 encePairwiseOnDemand]: 188/197 looper letters, 10 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2021-06-11 15:28:53,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 424 flow [2021-06-11 15:28:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:28:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:28:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-06-11 15:28:53,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7482233502538072 [2021-06-11 15:28:53,172 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-06-11 15:28:53,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-06-11 15:28:53,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:53,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-06-11 15:28:53,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,176 INFO L185 Difference]: Start difference. First operand has 56 places, 46 transitions, 336 flow. Second operand 5 states and 737 transitions. [2021-06-11 15:28:53,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 424 flow [2021-06-11 15:28:53,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 352 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-11 15:28:53,199 INFO L241 Difference]: Finished difference. Result has 54 places, 54 transitions, 350 flow [2021-06-11 15:28:53,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2021-06-11 15:28:53,199 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2021-06-11 15:28:53,199 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:53,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 54 transitions, 350 flow [2021-06-11 15:28:53,200 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 350 flow [2021-06-11 15:28:53,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 350 flow [2021-06-11 15:28:53,235 INFO L129 PetriNetUnfolder]: 130/431 cut-off events. [2021-06-11 15:28:53,235 INFO L130 PetriNetUnfolder]: For 927/1072 co-relation queries the response was YES. [2021-06-11 15:28:53,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 431 events. 130/431 cut-off events. For 927/1072 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3232 event pairs, 12 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 1638. Up to 179 conditions per place. [2021-06-11 15:28:53,241 INFO L151 LiptonReduction]: Number of co-enabled transitions 626 [2021-06-11 15:28:53,254 INFO L163 LiptonReduction]: Checked pairs total: 362 [2021-06-11 15:28:53,254 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:53,254 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-06-11 15:28:53,254 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 350 flow [2021-06-11 15:28:53,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:53,255 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:53,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:28:53,255 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 54671547, now seen corresponding path program 2 times [2021-06-11 15:28:53,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:53,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725894693] [2021-06-11 15:28:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:53,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:53,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,306 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 15:28:53,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 15:28:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:53,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725894693] [2021-06-11 15:28:53,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:53,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:28:53,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573213958] [2021-06-11 15:28:53,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:28:53,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:28:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:28:53,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 197 [2021-06-11 15:28:53,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:53,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 197 [2021-06-11 15:28:53,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:53,419 INFO L129 PetriNetUnfolder]: 159/501 cut-off events. [2021-06-11 15:28:53,419 INFO L130 PetriNetUnfolder]: For 1138/1469 co-relation queries the response was YES. [2021-06-11 15:28:53,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 501 events. 159/501 cut-off events. For 1138/1469 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3736 event pairs, 11 based on Foata normal form. 18/463 useless extension candidates. Maximal degree in co-relation 2001. Up to 208 conditions per place. [2021-06-11 15:28:53,423 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 9 selfloop transitions, 4 changer transitions 16/61 dead transitions. [2021-06-11 15:28:53,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 444 flow [2021-06-11 15:28:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:28:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:28:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2021-06-11 15:28:53,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7461928934010152 [2021-06-11 15:28:53,426 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 882 transitions. [2021-06-11 15:28:53,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 882 transitions. [2021-06-11 15:28:53,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:53,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 882 transitions. [2021-06-11 15:28:53,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,430 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,430 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 350 flow. Second operand 6 states and 882 transitions. [2021-06-11 15:28:53,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 444 flow [2021-06-11 15:28:53,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:28:53,444 INFO L241 Difference]: Finished difference. Result has 60 places, 43 transitions, 271 flow [2021-06-11 15:28:53,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2021-06-11 15:28:53,444 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2021-06-11 15:28:53,444 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:53,445 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 43 transitions, 271 flow [2021-06-11 15:28:53,445 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 43 transitions, 271 flow [2021-06-11 15:28:53,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 43 transitions, 271 flow [2021-06-11 15:28:53,464 INFO L129 PetriNetUnfolder]: 44/211 cut-off events. [2021-06-11 15:28:53,464 INFO L130 PetriNetUnfolder]: For 445/497 co-relation queries the response was YES. [2021-06-11 15:28:53,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 211 events. 44/211 cut-off events. For 445/497 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1403 event pairs, 12 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 761. Up to 72 conditions per place. [2021-06-11 15:28:53,466 INFO L151 LiptonReduction]: Number of co-enabled transitions 364 [2021-06-11 15:28:53,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:53,503 INFO L163 LiptonReduction]: Checked pairs total: 432 [2021-06-11 15:28:53,503 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:28:53,503 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-06-11 15:28:53,504 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 269 flow [2021-06-11 15:28:53,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,504 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:53,504 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:53,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:28:53,504 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash -172757911, now seen corresponding path program 3 times [2021-06-11 15:28:53,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:53,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739291982] [2021-06-11 15:28:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:53,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:53,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,555 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 15:28:53,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 15:28:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:53,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739291982] [2021-06-11 15:28:53,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:53,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:28:53,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236293648] [2021-06-11 15:28:53,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:28:53,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:28:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:28:53,569 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 198 [2021-06-11 15:28:53,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:53,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 198 [2021-06-11 15:28:53,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:53,642 INFO L129 PetriNetUnfolder]: 64/278 cut-off events. [2021-06-11 15:28:53,642 INFO L130 PetriNetUnfolder]: For 641/730 co-relation queries the response was YES. [2021-06-11 15:28:53,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 278 events. 64/278 cut-off events. For 641/730 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2022 event pairs, 8 based on Foata normal form. 4/258 useless extension candidates. Maximal degree in co-relation 1084. Up to 99 conditions per place. [2021-06-11 15:28:53,644 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 9 selfloop transitions, 9 changer transitions 2/50 dead transitions. [2021-06-11 15:28:53,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 356 flow [2021-06-11 15:28:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:28:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:28:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-06-11 15:28:53,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7505050505050505 [2021-06-11 15:28:53,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-06-11 15:28:53,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-06-11 15:28:53,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:53,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-06-11 15:28:53,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,650 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 269 flow. Second operand 5 states and 743 transitions. [2021-06-11 15:28:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 356 flow [2021-06-11 15:28:53,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 338 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 15:28:53,656 INFO L241 Difference]: Finished difference. Result has 58 places, 46 transitions, 311 flow [2021-06-11 15:28:53,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2021-06-11 15:28:53,656 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2021-06-11 15:28:53,656 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:53,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 46 transitions, 311 flow [2021-06-11 15:28:53,657 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 311 flow [2021-06-11 15:28:53,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 311 flow [2021-06-11 15:28:53,682 INFO L129 PetriNetUnfolder]: 53/257 cut-off events. [2021-06-11 15:28:53,683 INFO L130 PetriNetUnfolder]: For 567/612 co-relation queries the response was YES. [2021-06-11 15:28:53,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 257 events. 53/257 cut-off events. For 567/612 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1894 event pairs, 7 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 983. Up to 77 conditions per place. [2021-06-11 15:28:53,686 INFO L151 LiptonReduction]: Number of co-enabled transitions 400 [2021-06-11 15:28:53,691 INFO L163 LiptonReduction]: Checked pairs total: 183 [2021-06-11 15:28:53,692 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:28:53,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-06-11 15:28:53,692 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 311 flow [2021-06-11 15:28:53,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:53,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:53,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:28:53,693 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1428305810, now seen corresponding path program 1 times [2021-06-11 15:28:53,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:53,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110082877] [2021-06-11 15:28:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:28:53,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:53,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:53,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:28:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:28:53,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110082877] [2021-06-11 15:28:53,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:28:53,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:28:53,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978472396] [2021-06-11 15:28:53,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:28:53,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:28:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:28:53,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:28:53,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-06-11 15:28:53,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:28:53,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-06-11 15:28:53,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:28:53,802 INFO L129 PetriNetUnfolder]: 56/297 cut-off events. [2021-06-11 15:28:53,802 INFO L130 PetriNetUnfolder]: For 690/750 co-relation queries the response was YES. [2021-06-11 15:28:53,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 297 events. 56/297 cut-off events. For 690/750 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2273 event pairs, 8 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 1154. Up to 86 conditions per place. [2021-06-11 15:28:53,804 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 1 changer transitions 19/46 dead transitions. [2021-06-11 15:28:53,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 329 flow [2021-06-11 15:28:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:28:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:28:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2021-06-11 15:28:53,806 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2021-06-11 15:28:53,806 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2021-06-11 15:28:53,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2021-06-11 15:28:53,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:28:53,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2021-06-11 15:28:53,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:53,810 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 311 flow. Second operand 4 states and 656 transitions. [2021-06-11 15:28:53,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 329 flow [2021-06-11 15:28:53,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 315 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-06-11 15:28:53,818 INFO L241 Difference]: Finished difference. Result has 61 places, 27 transitions, 147 flow [2021-06-11 15:28:53,818 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=61, PETRI_TRANSITIONS=27} [2021-06-11 15:28:53,818 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2021-06-11 15:28:53,818 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:28:53,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 27 transitions, 147 flow [2021-06-11 15:28:53,818 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 27 transitions, 147 flow [2021-06-11 15:28:53,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 27 transitions, 147 flow [2021-06-11 15:28:53,826 INFO L129 PetriNetUnfolder]: 13/62 cut-off events. [2021-06-11 15:28:53,826 INFO L130 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2021-06-11 15:28:53,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 62 events. 13/62 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 196 event pairs, 6 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 179. Up to 25 conditions per place. [2021-06-11 15:28:53,827 INFO L151 LiptonReduction]: Number of co-enabled transitions 58 [2021-06-11 15:28:54,366 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 161 [2021-06-11 15:28:54,482 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 15:28:55,454 WARN L205 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 226 [2021-06-11 15:28:55,842 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 15:28:55,864 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 15:28:55,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:28:55,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:55,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,879 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:28:55,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,891 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:28:55,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:28:55,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:28:55,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:28:55,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,910 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:28:55,910 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:28:55,911 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,912 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,913 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:28:55,913 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,914 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,914 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:28:55,914 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,915 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,918 INFO L147 QuantifierPusher]: treesize reduction 178, result has 42.4 percent of original size 131 [2021-06-11 15:28:55,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:28:55,922 INFO L142 QuantifierPusher]: treesize reduction 178, result has 57.0 percent of original size [2021-06-11 15:28:55,923 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 15:28:55,923 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,924 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,925 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:28:55,925 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,925 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,926 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 2, 2, 1] term [2021-06-11 15:28:55,926 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,927 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,931 INFO L147 QuantifierPusher]: treesize reduction 439, result has 22.0 percent of original size 124 [2021-06-11 15:28:55,931 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:28:55,932 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,933 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,933 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:28:55,934 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,934 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,935 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:28:55,936 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:28:55,936 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,945 INFO L147 QuantifierPusher]: treesize reduction 1762, result has 8.0 percent of original size 153 [2021-06-11 15:28:55,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:28:55,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:28:55,978 INFO L163 LiptonReduction]: Checked pairs total: 58 [2021-06-11 15:28:55,978 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:28:55,978 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2160 [2021-06-11 15:28:55,979 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 25 transitions, 143 flow [2021-06-11 15:28:55,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:28:55,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:28:55,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:28:55,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:28:55,980 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:28:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:28:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash -975110960, now seen corresponding path program 2 times [2021-06-11 15:28:55,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:28:55,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919266829] [2021-06-11 15:28:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:28:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:28:56,031 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:28:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:28:56,070 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:28:56,114 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:28:56,114 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:28:56,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:28:56,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:28:56 BasicIcfg [2021-06-11 15:28:56,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:28:56,206 INFO L168 Benchmark]: Toolchain (without parser) took 14577.41 ms. Allocated memory was 341.8 MB in the beginning and 685.8 MB in the end (delta: 343.9 MB). Free memory was 303.6 MB in the beginning and 504.9 MB in the end (delta: -201.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,206 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 341.8 MB. Free memory was 322.1 MB in the beginning and 322.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:28:56,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.54 ms. Allocated memory is still 341.8 MB. Free memory was 303.4 MB in the beginning and 299.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.59 ms. Allocated memory is still 341.8 MB. Free memory was 299.4 MB in the beginning and 296.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,207 INFO L168 Benchmark]: Boogie Preprocessor took 34.88 ms. Allocated memory is still 341.8 MB. Free memory was 296.2 MB in the beginning and 294.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,210 INFO L168 Benchmark]: RCFGBuilder took 2186.77 ms. Allocated memory is still 341.8 MB. Free memory was 294.1 MB in the beginning and 170.1 MB in the end (delta: 124.0 MB). Peak memory consumption was 131.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,210 INFO L168 Benchmark]: TraceAbstraction took 11777.12 ms. Allocated memory was 341.8 MB in the beginning and 685.8 MB in the end (delta: 343.9 MB). Free memory was 169.1 MB in the beginning and 504.9 MB in the end (delta: -335.8 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:28:56,210 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.17 ms. Allocated memory is still 341.8 MB. Free memory was 322.1 MB in the beginning and 322.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 506.54 ms. Allocated memory is still 341.8 MB. Free memory was 303.4 MB in the beginning and 299.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.59 ms. Allocated memory is still 341.8 MB. Free memory was 299.4 MB in the beginning and 296.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.88 ms. Allocated memory is still 341.8 MB. Free memory was 296.2 MB in the beginning and 294.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2186.77 ms. Allocated memory is still 341.8 MB. Free memory was 294.1 MB in the beginning and 170.1 MB in the end (delta: 124.0 MB). Peak memory consumption was 131.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11777.12 ms. Allocated memory was 341.8 MB in the beginning and 685.8 MB in the end (delta: 343.9 MB). Free memory was 169.1 MB in the beginning and 504.9 MB in the end (delta: -335.8 MB). Peak memory consumption was 8.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: 6316.2ms, 108 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 27 TransitionsAfterwards, 1760 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 5543 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2364, positive: 2182, positive conditional: 2182, positive unconditional: 0, negative: 182, negative conditional: 182, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2364, positive: 2182, positive conditional: 0, positive unconditional: 2182, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2364, positive: 2182, positive conditional: 0, positive unconditional: 2182, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1455, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1455, positive: 1390, positive conditional: 0, positive unconditional: 1390, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 786, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 768, negative conditional: 0, negative unconditional: 768, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2364, positive: 784, positive conditional: 0, positive unconditional: 784, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 1455, unknown conditional: 0, unknown unconditional: 1455] , Statistics on independence cache: Total cache size (in pairs): 1455, Positive cache size: 1398, Positive conditional cache size: 0, Positive unconditional cache size: 1398, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.1ms, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 11, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1407, Positive conditional cache size: 0, Positive unconditional cache size: 1407, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.4ms, 34 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1467, Positive cache size: 1408, Positive conditional cache size: 0, Positive unconditional cache size: 1408, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.5ms, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 66, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1410, Positive conditional cache size: 0, Positive unconditional cache size: 1410, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.6ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1410, Positive conditional cache size: 0, Positive unconditional cache size: 1410, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.5ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1410, Positive conditional cache size: 0, Positive unconditional cache size: 1410, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 184 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, positive: 58, positive conditional: 12, positive unconditional: 46, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 58, positive conditional: 12, positive unconditional: 46, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 57, positive conditional: 12, positive unconditional: 45, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1411, Positive conditional cache size: 0, Positive unconditional cache size: 1411, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 310 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, positive: 206, positive conditional: 206, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, positive: 206, positive conditional: 122, positive unconditional: 84, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 206, positive conditional: 122, positive unconditional: 84, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 4, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, positive: 195, positive conditional: 118, positive unconditional: 77, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1422, Positive conditional cache size: 4, Positive unconditional cache size: 1418, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.6ms, 57 PlacesBefore, 56 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 292 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, positive: 204, positive conditional: 204, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, positive: 204, positive conditional: 146, positive unconditional: 58, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 204, positive conditional: 146, positive unconditional: 58, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, positive: 204, positive conditional: 146, positive unconditional: 58, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1422, Positive conditional cache size: 4, Positive unconditional cache size: 1418, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 362 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, positive: 155, positive conditional: 119, positive unconditional: 36, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, positive: 155, positive conditional: 119, positive unconditional: 36, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, positive: 155, positive conditional: 119, positive unconditional: 36, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1422, Positive conditional cache size: 4, Positive unconditional cache size: 1418, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.1ms, 60 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 432 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 336, positive: 316, positive conditional: 316, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, positive: 316, positive conditional: 234, positive unconditional: 82, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, positive: 316, positive conditional: 234, positive unconditional: 82, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 3, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, positive: 306, positive conditional: 231, positive unconditional: 75, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1492, Positive cache size: 1432, Positive conditional cache size: 7, Positive unconditional cache size: 1425, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 183 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 102, positive conditional: 75, positive unconditional: 27, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 102, positive conditional: 75, positive unconditional: 27, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 102, positive conditional: 75, positive unconditional: 27, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1492, Positive cache size: 1432, Positive conditional cache size: 7, Positive unconditional cache size: 1425, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2159.7ms, 61 PlacesBefore, 50 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 58 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, positive: 49, positive conditional: 28, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 49, positive conditional: 28, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 55, positive: 47, positive conditional: 28, positive unconditional: 19, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1494, Positive cache size: 1434, Positive conditional cache size: 7, Positive unconditional cache size: 1427, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 1 z = 1 [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11561.5ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1120.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6444.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 80 SDtfs, 40 SDslu, 37 SDs, 0 SdLazy, 173 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 244.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 187.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=9, 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: 41.2ms SsaConstructionTime, 411.1ms SatisfiabilityAnalysisTime, 657.8ms InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...