/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 23:58:56,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 23:58:56,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 23:58:56,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 23:58:56,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 23:58:56,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 23:58:56,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 23:58:56,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 23:58:56,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 23:58:56,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 23:58:56,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 23:58:56,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 23:58:56,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 23:58:56,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 23:58:56,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 23:58:56,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 23:58:56,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 23:58:56,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 23:58:56,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 23:58:56,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 23:58:56,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 23:58:56,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 23:58:56,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 23:58:56,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 23:58:56,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 23:58:56,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 23:58:56,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 23:58:56,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 23:58:56,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 23:58:56,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 23:58:56,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 23:58:56,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 23:58:56,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 23:58:56,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 23:58:56,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 23:58:56,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 23:58:56,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 23:58:56,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 23:58:56,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 23:58:56,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 23:58:56,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 23:58:56,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-25 23:58:56,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 23:58:56,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 23:58:56,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 23:58:56,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 23:58:56,431 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 23:58:56,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 23:58:56,431 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 23:58:56,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 23:58:56,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 23:58:56,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 23:58:56,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 23:58:56,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 23:58:56,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:58:56,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 23:58:56,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 23:58:56,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 23:58:56,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-25 23:58:56,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 23:58:56,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 23:58:56,435 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 23:58:56,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 23:58:56,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 23:58:56,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 23:58:56,755 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 23:58:56,756 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 23:58:56,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc.i [2021-03-25 23:58:56,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64132c9f1/a6f2e964f2f941a08f71deebb47aad65/FLAG11fdef48d [2021-03-25 23:58:57,343 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 23:58:57,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc.i [2021-03-25 23:58:57,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64132c9f1/a6f2e964f2f941a08f71deebb47aad65/FLAG11fdef48d [2021-03-25 23:58:57,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64132c9f1/a6f2e964f2f941a08f71deebb47aad65 [2021-03-25 23:58:57,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 23:58:57,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 23:58:57,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 23:58:57,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 23:58:57,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 23:58:57,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:58:57" (1/1) ... [2021-03-25 23:58:57,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d0c838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:57, skipping insertion in model container [2021-03-25 23:58:57,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:58:57" (1/1) ... [2021-03-25 23:58:57,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 23:58:57,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 23:58:57,877 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/mix005_power.oepc.i[951,964] [2021-03-25 23:58:58,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:58:58,111 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 23:58:58,122 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/mix005_power.oepc.i[951,964] [2021-03-25 23:58:58,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:58:58,257 INFO L208 MainTranslator]: Completed translation [2021-03-25 23:58:58,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58 WrapperNode [2021-03-25 23:58:58,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 23:58:58,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 23:58:58,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 23:58:58,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 23:58:58,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 23:58:58,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 23:58:58,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 23:58:58,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 23:58:58,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... [2021-03-25 23:58:58,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 23:58:58,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 23:58:58,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 23:58:58,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 23:58:58,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:58:58,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 23:58:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 23:58:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 23:58:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 23:58:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 23:58:58,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 23:58:58,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 23:58:58,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 23:58:58,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 23:58:58,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 23:58:58,441 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 23:58:58,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 23:58:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 23:58:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 23:58:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 23:58:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 23:58:58,443 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 23:59:00,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 23:59:00,245 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 23:59:00,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:59:00 BoogieIcfgContainer [2021-03-25 23:59:00,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 23:59:00,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 23:59:00,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 23:59:00,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 23:59:00,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 11:58:57" (1/3) ... [2021-03-25 23:59:00,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955f940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:59:00, skipping insertion in model container [2021-03-25 23:59:00,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:58" (2/3) ... [2021-03-25 23:59:00,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955f940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:59:00, skipping insertion in model container [2021-03-25 23:59:00,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:59:00" (3/3) ... [2021-03-25 23:59:00,254 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc.i [2021-03-25 23:59:00,259 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 23:59:00,262 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 23:59:00,262 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,329 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,330 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:59:00,356 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 23:59:00,371 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 23:59:00,395 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 23:59:00,395 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 23:59:00,395 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 23:59:00,395 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 23:59:00,395 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 23:59:00,395 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 23:59:00,395 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 23:59:00,395 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 23:59:00,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 23:59:00,455 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 23:59:00,455 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:59:00,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 23:59:00,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 23:59:00,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 23:59:00,466 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:00,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 23:59:00,476 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 23:59:00,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 23:59:00,510 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 23:59:00,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:59:00,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 23:59:00,515 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-25 23:59:02,045 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 23:59:02,441 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 23:59:02,570 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 23:59:03,903 INFO L154 LiptonReduction]: Checked pairs total: 5647 [2021-03-25 23:59:03,903 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 23:59:03,905 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3440 [2021-03-25 23:59:03,918 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 23:59:03,918 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:59:03,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:03,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:03,919 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:03,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435965, now seen corresponding path program 1 times [2021-03-25 23:59:03,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:03,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036570426] [2021-03-25 23:59:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:04,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:04,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:04,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:04,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:04,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036570426] [2021-03-25 23:59:04,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:04,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:59:04,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249042742] [2021-03-25 23:59:04,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 23:59:04,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 23:59:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 23:59:04,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-25 23:59:04,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:04,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:04,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-25 23:59:04,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:04,286 INFO L129 PetriNetUnfolder]: 133/349 cut-off events. [2021-03-25 23:59:04,286 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:59:04,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 349 events. 133/349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1875 event pairs, 110 based on Foata normal form. 33/362 useless extension candidates. Maximal degree in co-relation 546. Up to 153 conditions per place. [2021-03-25 23:59:04,292 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 23:59:04,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-25 23:59:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:59:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:59:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 23:59:04,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-25 23:59:04,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 23:59:04,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 23:59:04,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:04,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 23:59:04,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:04,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:04,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:04,329 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-25 23:59:04,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-25 23:59:04,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 23:59:04,335 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-25 23:59:04,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-25 23:59:04,337 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 23:59:04,338 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:04,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 23:59:04,338 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 23:59:04,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-25 23:59:04,345 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-25 23:59:04,345 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:59:04,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 23:59:04,347 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-25 23:59:05,550 INFO L154 LiptonReduction]: Checked pairs total: 3042 [2021-03-25 23:59:05,551 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 23:59:05,551 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1213 [2021-03-25 23:59:05,553 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 82 flow [2021-03-25 23:59:05,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:05,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:05,553 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:05,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 23:59:05,554 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-25 23:59:05,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:05,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424542553] [2021-03-25 23:59:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:05,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:05,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:05,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:05,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:05,688 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:59:05,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:05,711 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 23:59:05,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:59:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:05,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424542553] [2021-03-25 23:59:05,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:05,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:59:05,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176653609] [2021-03-25 23:59:05,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:59:05,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:05,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:59:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:59:05,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 207 [2021-03-25 23:59:05,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:05,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:05,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 207 [2021-03-25 23:59:05,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:05,913 INFO L129 PetriNetUnfolder]: 397/800 cut-off events. [2021-03-25 23:59:05,913 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 23:59:05,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 800 events. 397/800 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4542 event pairs, 34 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 1413. Up to 253 conditions per place. [2021-03-25 23:59:05,918 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 12 selfloop transitions, 8 changer transitions 21/65 dead transitions. [2021-03-25 23:59:05,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 224 flow [2021-03-25 23:59:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:59:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:59:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-03-25 23:59:05,922 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8122843340234644 [2021-03-25 23:59:05,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-03-25 23:59:05,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-03-25 23:59:05,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:05,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-03-25 23:59:05,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:05,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:05,929 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:05,929 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 82 flow. Second operand 7 states and 1177 transitions. [2021-03-25 23:59:05,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 224 flow [2021-03-25 23:59:05,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:59:05,931 INFO L241 Difference]: Finished difference. Result has 55 places, 40 transitions, 148 flow [2021-03-25 23:59:05,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2021-03-25 23:59:05,932 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2021-03-25 23:59:05,932 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:05,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-25 23:59:05,933 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-25 23:59:05,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 148 flow [2021-03-25 23:59:05,989 INFO L129 PetriNetUnfolder]: 178/461 cut-off events. [2021-03-25 23:59:05,989 INFO L130 PetriNetUnfolder]: For 124/258 co-relation queries the response was YES. [2021-03-25 23:59:05,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 461 events. 178/461 cut-off events. For 124/258 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2856 event pairs, 98 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 1035. Up to 249 conditions per place. [2021-03-25 23:59:05,995 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-25 23:59:06,808 INFO L154 LiptonReduction]: Checked pairs total: 1230 [2021-03-25 23:59:06,808 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 23:59:06,808 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 876 [2021-03-25 23:59:06,809 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 142 flow [2021-03-25 23:59:06,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:06,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:06,810 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:06,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 23:59:06,810 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1102842643, now seen corresponding path program 1 times [2021-03-25 23:59:06,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:06,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574634210] [2021-03-25 23:59:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:06,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:06,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:06,923 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:59:06,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:06,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574634210] [2021-03-25 23:59:06,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:06,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:59:06,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090840540] [2021-03-25 23:59:06,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:59:06,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:59:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:59:06,936 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 210 [2021-03-25 23:59:06,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:06,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:06,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 210 [2021-03-25 23:59:06,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:07,056 INFO L129 PetriNetUnfolder]: 164/424 cut-off events. [2021-03-25 23:59:07,056 INFO L130 PetriNetUnfolder]: For 274/449 co-relation queries the response was YES. [2021-03-25 23:59:07,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 424 events. 164/424 cut-off events. For 274/449 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2375 event pairs, 22 based on Foata normal form. 14/426 useless extension candidates. Maximal degree in co-relation 1258. Up to 215 conditions per place. [2021-03-25 23:59:07,059 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 16 selfloop transitions, 13 changer transitions 0/50 dead transitions. [2021-03-25 23:59:07,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 278 flow [2021-03-25 23:59:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:59:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:59:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions. [2021-03-25 23:59:07,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2021-03-25 23:59:07,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 685 transitions. [2021-03-25 23:59:07,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions. [2021-03-25 23:59:07,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:07,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions. [2021-03-25 23:59:07,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:07,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:07,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:07,066 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 142 flow. Second operand 4 states and 685 transitions. [2021-03-25 23:59:07,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 278 flow [2021-03-25 23:59:07,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 248 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 23:59:07,071 INFO L241 Difference]: Finished difference. Result has 51 places, 46 transitions, 245 flow [2021-03-25 23:59:07,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2021-03-25 23:59:07,071 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2021-03-25 23:59:07,071 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:07,072 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 245 flow [2021-03-25 23:59:07,072 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 245 flow [2021-03-25 23:59:07,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 245 flow [2021-03-25 23:59:07,118 INFO L129 PetriNetUnfolder]: 163/458 cut-off events. [2021-03-25 23:59:07,118 INFO L130 PetriNetUnfolder]: For 353/361 co-relation queries the response was YES. [2021-03-25 23:59:07,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 458 events. 163/458 cut-off events. For 353/361 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2889 event pairs, 87 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 1211. Up to 215 conditions per place. [2021-03-25 23:59:07,124 INFO L142 LiptonReduction]: Number of co-enabled transitions 700 [2021-03-25 23:59:07,619 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 23:59:07,783 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 23:59:08,118 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 23:59:08,264 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 23:59:08,291 INFO L154 LiptonReduction]: Checked pairs total: 1458 [2021-03-25 23:59:08,291 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:59:08,291 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1220 [2021-03-25 23:59:08,292 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 243 flow [2021-03-25 23:59:08,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:08,293 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:08,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 23:59:08,293 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1142820115, now seen corresponding path program 1 times [2021-03-25 23:59:08,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:08,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477234816] [2021-03-25 23:59:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:08,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:08,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:08,341 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:59:08,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:08,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477234816] [2021-03-25 23:59:08,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:08,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:59:08,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830684475] [2021-03-25 23:59:08,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:59:08,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:59:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:59:08,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 211 [2021-03-25 23:59:08,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:08,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 211 [2021-03-25 23:59:08,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:08,454 INFO L129 PetriNetUnfolder]: 151/414 cut-off events. [2021-03-25 23:59:08,455 INFO L130 PetriNetUnfolder]: For 440/718 co-relation queries the response was YES. [2021-03-25 23:59:08,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 414 events. 151/414 cut-off events. For 440/718 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2377 event pairs, 66 based on Foata normal form. 7/410 useless extension candidates. Maximal degree in co-relation 1378. Up to 212 conditions per place. [2021-03-25 23:59:08,458 INFO L132 encePairwiseOnDemand]: 202/211 looper letters, 11 selfloop transitions, 26 changer transitions 0/58 dead transitions. [2021-03-25 23:59:08,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 407 flow [2021-03-25 23:59:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:59:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:59:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2021-03-25 23:59:08,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8127962085308057 [2021-03-25 23:59:08,465 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2021-03-25 23:59:08,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2021-03-25 23:59:08,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:08,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2021-03-25 23:59:08,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,469 INFO L185 Difference]: Start difference. First operand has 50 places, 45 transitions, 243 flow. Second operand 4 states and 686 transitions. [2021-03-25 23:59:08,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 407 flow [2021-03-25 23:59:08,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:59:08,475 INFO L241 Difference]: Finished difference. Result has 54 places, 54 transitions, 396 flow [2021-03-25 23:59:08,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2021-03-25 23:59:08,475 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2021-03-25 23:59:08,475 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:08,475 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 54 transitions, 396 flow [2021-03-25 23:59:08,476 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 396 flow [2021-03-25 23:59:08,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 396 flow [2021-03-25 23:59:08,516 INFO L129 PetriNetUnfolder]: 151/404 cut-off events. [2021-03-25 23:59:08,516 INFO L130 PetriNetUnfolder]: For 591/689 co-relation queries the response was YES. [2021-03-25 23:59:08,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 404 events. 151/404 cut-off events. For 591/689 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2349 event pairs, 62 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 1396. Up to 198 conditions per place. [2021-03-25 23:59:08,522 INFO L142 LiptonReduction]: Number of co-enabled transitions 856 [2021-03-25 23:59:08,643 INFO L154 LiptonReduction]: Checked pairs total: 1032 [2021-03-25 23:59:08,643 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:59:08,643 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-25 23:59:08,644 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 396 flow [2021-03-25 23:59:08,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:08,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:08,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 23:59:08,645 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 624430680, now seen corresponding path program 1 times [2021-03-25 23:59:08,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:08,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791847728] [2021-03-25 23:59:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:08,747 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 23:59:08,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:59:08,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:08,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:08,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791847728] [2021-03-25 23:59:08,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:08,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:59:08,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413041134] [2021-03-25 23:59:08,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:59:08,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:59:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:59:08,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-25 23:59:08,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:08,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-25 23:59:08,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:09,014 INFO L129 PetriNetUnfolder]: 1065/2087 cut-off events. [2021-03-25 23:59:09,014 INFO L130 PetriNetUnfolder]: For 1229/1373 co-relation queries the response was YES. [2021-03-25 23:59:09,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 2087 events. 1065/2087 cut-off events. For 1229/1373 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 16502 event pairs, 491 based on Foata normal form. 150/1858 useless extension candidates. Maximal degree in co-relation 5027. Up to 1377 conditions per place. [2021-03-25 23:59:09,035 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 12 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-25 23:59:09,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 468 flow [2021-03-25 23:59:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 23:59:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 23:59:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-03-25 23:59:09,038 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.852132701421801 [2021-03-25 23:59:09,038 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-03-25 23:59:09,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-03-25 23:59:09,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:09,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-03-25 23:59:09,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,043 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,043 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 396 flow. Second operand 5 states and 899 transitions. [2021-03-25 23:59:09,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 468 flow [2021-03-25 23:59:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 23:59:09,050 INFO L241 Difference]: Finished difference. Result has 61 places, 63 transitions, 471 flow [2021-03-25 23:59:09,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2021-03-25 23:59:09,050 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2021-03-25 23:59:09,050 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:09,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 471 flow [2021-03-25 23:59:09,050 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 471 flow [2021-03-25 23:59:09,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 471 flow [2021-03-25 23:59:09,202 INFO L129 PetriNetUnfolder]: 785/1598 cut-off events. [2021-03-25 23:59:09,202 INFO L130 PetriNetUnfolder]: For 1973/2436 co-relation queries the response was YES. [2021-03-25 23:59:09,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 1598 events. 785/1598 cut-off events. For 1973/2436 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 12451 event pairs, 353 based on Foata normal form. 18/1467 useless extension candidates. Maximal degree in co-relation 5101. Up to 945 conditions per place. [2021-03-25 23:59:09,265 INFO L142 LiptonReduction]: Number of co-enabled transitions 1274 [2021-03-25 23:59:09,730 INFO L154 LiptonReduction]: Checked pairs total: 2324 [2021-03-25 23:59:09,730 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:59:09,730 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 680 [2021-03-25 23:59:09,731 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 465 flow [2021-03-25 23:59:09,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:09,731 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:09,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 23:59:09,732 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -478045595, now seen corresponding path program 1 times [2021-03-25 23:59:09,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:09,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445362091] [2021-03-25 23:59:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:09,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:09,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:09,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:09,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:09,775 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:59:09,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:09,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445362091] [2021-03-25 23:59:09,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:09,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:59:09,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885948601] [2021-03-25 23:59:09,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:59:09,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:59:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:59:09,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 211 [2021-03-25 23:59:09,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:09,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 211 [2021-03-25 23:59:09,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:09,994 INFO L129 PetriNetUnfolder]: 881/1768 cut-off events. [2021-03-25 23:59:09,994 INFO L130 PetriNetUnfolder]: For 2898/3876 co-relation queries the response was YES. [2021-03-25 23:59:10,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 1768 events. 881/1768 cut-off events. For 2898/3876 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 13303 event pairs, 440 based on Foata normal form. 72/1664 useless extension candidates. Maximal degree in co-relation 5822. Up to 1105 conditions per place. [2021-03-25 23:59:10,011 INFO L132 encePairwiseOnDemand]: 205/211 looper letters, 21 selfloop transitions, 16 changer transitions 4/66 dead transitions. [2021-03-25 23:59:10,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 586 flow [2021-03-25 23:59:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:59:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:59:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-25 23:59:10,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104265402843602 [2021-03-25 23:59:10,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-25 23:59:10,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-25 23:59:10,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:10,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-25 23:59:10,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,017 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,017 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 465 flow. Second operand 4 states and 684 transitions. [2021-03-25 23:59:10,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 586 flow [2021-03-25 23:59:10,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 579 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 23:59:10,031 INFO L241 Difference]: Finished difference. Result has 62 places, 57 transitions, 478 flow [2021-03-25 23:59:10,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2021-03-25 23:59:10,031 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2021-03-25 23:59:10,031 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:10,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 57 transitions, 478 flow [2021-03-25 23:59:10,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 57 transitions, 478 flow [2021-03-25 23:59:10,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 57 transitions, 478 flow [2021-03-25 23:59:10,186 INFO L129 PetriNetUnfolder]: 815/1638 cut-off events. [2021-03-25 23:59:10,186 INFO L130 PetriNetUnfolder]: For 2491/2825 co-relation queries the response was YES. [2021-03-25 23:59:10,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 1638 events. 815/1638 cut-off events. For 2491/2825 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 12338 event pairs, 403 based on Foata normal form. 4/1511 useless extension candidates. Maximal degree in co-relation 5066. Up to 999 conditions per place. [2021-03-25 23:59:10,212 INFO L142 LiptonReduction]: Number of co-enabled transitions 944 [2021-03-25 23:59:10,488 INFO L154 LiptonReduction]: Checked pairs total: 799 [2021-03-25 23:59:10,488 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:59:10,488 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 457 [2021-03-25 23:59:10,492 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 478 flow [2021-03-25 23:59:10,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:10,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:10,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 23:59:10,493 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1402123986, now seen corresponding path program 1 times [2021-03-25 23:59:10,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:10,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711648406] [2021-03-25 23:59:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:10,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:10,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:10,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:10,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:10,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:10,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:10,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711648406] [2021-03-25 23:59:10,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:10,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:59:10,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190202652] [2021-03-25 23:59:10,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:59:10,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:59:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:59:10,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2021-03-25 23:59:10,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:10,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2021-03-25 23:59:10,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:10,888 INFO L129 PetriNetUnfolder]: 1296/2569 cut-off events. [2021-03-25 23:59:10,889 INFO L130 PetriNetUnfolder]: For 4423/5097 co-relation queries the response was YES. [2021-03-25 23:59:10,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7776 conditions, 2569 events. 1296/2569 cut-off events. For 4423/5097 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 20757 event pairs, 674 based on Foata normal form. 61/2377 useless extension candidates. Maximal degree in co-relation 7750. Up to 1724 conditions per place. [2021-03-25 23:59:10,913 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 7 selfloop transitions, 3 changer transitions 2/60 dead transitions. [2021-03-25 23:59:10,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 533 flow [2021-03-25 23:59:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:59:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:59:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 716 transitions. [2021-03-25 23:59:10,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8483412322274881 [2021-03-25 23:59:10,916 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 716 transitions. [2021-03-25 23:59:10,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 716 transitions. [2021-03-25 23:59:10,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:10,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 716 transitions. [2021-03-25 23:59:10,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:10,919 INFO L185 Difference]: Start difference. First operand has 62 places, 57 transitions, 478 flow. Second operand 4 states and 716 transitions. [2021-03-25 23:59:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 533 flow [2021-03-25 23:59:10,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 517 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-03-25 23:59:10,927 INFO L241 Difference]: Finished difference. Result has 67 places, 58 transitions, 485 flow [2021-03-25 23:59:10,927 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2021-03-25 23:59:10,928 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2021-03-25 23:59:10,928 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:10,928 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 58 transitions, 485 flow [2021-03-25 23:59:10,928 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 58 transitions, 485 flow [2021-03-25 23:59:10,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 58 transitions, 485 flow [2021-03-25 23:59:11,154 INFO L129 PetriNetUnfolder]: 1219/2419 cut-off events. [2021-03-25 23:59:11,154 INFO L130 PetriNetUnfolder]: For 3865/4435 co-relation queries the response was YES. [2021-03-25 23:59:11,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 2419 events. 1219/2419 cut-off events. For 3865/4435 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 19943 event pairs, 611 based on Foata normal form. 1/2178 useless extension candidates. Maximal degree in co-relation 7445. Up to 1584 conditions per place. [2021-03-25 23:59:11,199 INFO L142 LiptonReduction]: Number of co-enabled transitions 968 [2021-03-25 23:59:12,353 INFO L154 LiptonReduction]: Checked pairs total: 1611 [2021-03-25 23:59:12,353 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 23:59:12,353 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1425 [2021-03-25 23:59:12,354 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 491 flow [2021-03-25 23:59:12,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:12,354 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:12,354 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:12,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 23:59:12,354 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -23724854, now seen corresponding path program 2 times [2021-03-25 23:59:12,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:12,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211764930] [2021-03-25 23:59:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:12,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:12,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:12,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:12,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:12,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:12,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:12,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:12,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:12,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211764930] [2021-03-25 23:59:12,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:12,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:59:12,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795682055] [2021-03-25 23:59:12,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:59:12,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:59:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:59:12,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2021-03-25 23:59:12,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:12,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:12,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2021-03-25 23:59:12,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:12,769 INFO L129 PetriNetUnfolder]: 1435/2885 cut-off events. [2021-03-25 23:59:12,769 INFO L130 PetriNetUnfolder]: For 3886/6403 co-relation queries the response was YES. [2021-03-25 23:59:12,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10503 conditions, 2885 events. 1435/2885 cut-off events. For 3886/6403 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 23463 event pairs, 223 based on Foata normal form. 468/3079 useless extension candidates. Maximal degree in co-relation 10474. Up to 2010 conditions per place. [2021-03-25 23:59:12,797 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 13 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2021-03-25 23:59:12,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 625 flow [2021-03-25 23:59:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:59:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:59:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1091 transitions. [2021-03-25 23:59:12,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8536776212832551 [2021-03-25 23:59:12,800 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1091 transitions. [2021-03-25 23:59:12,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1091 transitions. [2021-03-25 23:59:12,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:12,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1091 transitions. [2021-03-25 23:59:12,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:12,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:12,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:12,806 INFO L185 Difference]: Start difference. First operand has 67 places, 58 transitions, 491 flow. Second operand 6 states and 1091 transitions. [2021-03-25 23:59:12,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 625 flow [2021-03-25 23:59:12,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:59:12,813 INFO L241 Difference]: Finished difference. Result has 74 places, 67 transitions, 608 flow [2021-03-25 23:59:12,813 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2021-03-25 23:59:12,813 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2021-03-25 23:59:12,813 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:12,814 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 67 transitions, 608 flow [2021-03-25 23:59:12,814 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 67 transitions, 608 flow [2021-03-25 23:59:12,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 67 transitions, 608 flow [2021-03-25 23:59:13,006 INFO L129 PetriNetUnfolder]: 906/2021 cut-off events. [2021-03-25 23:59:13,006 INFO L130 PetriNetUnfolder]: For 6521/8506 co-relation queries the response was YES. [2021-03-25 23:59:13,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 2021 events. 906/2021 cut-off events. For 6521/8506 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 17398 event pairs, 182 based on Foata normal form. 49/1958 useless extension candidates. Maximal degree in co-relation 9061. Up to 1423 conditions per place. [2021-03-25 23:59:13,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 1312 [2021-03-25 23:59:14,130 INFO L154 LiptonReduction]: Checked pairs total: 2061 [2021-03-25 23:59:14,131 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:59:14,131 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1318 [2021-03-25 23:59:14,132 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 600 flow [2021-03-25 23:59:14,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:14,132 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:14,132 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:14,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 23:59:14,133 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1162861593, now seen corresponding path program 1 times [2021-03-25 23:59:14,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:14,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222448123] [2021-03-25 23:59:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:14,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:14,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:14,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:14,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:14,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:14,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:14,198 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:59:14,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:14,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222448123] [2021-03-25 23:59:14,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:14,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:59:14,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626058377] [2021-03-25 23:59:14,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:59:14,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:59:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:59:14,213 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 213 [2021-03-25 23:59:14,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 600 flow. Second operand has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:14,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:14,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 213 [2021-03-25 23:59:14,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:14,550 INFO L129 PetriNetUnfolder]: 1209/2653 cut-off events. [2021-03-25 23:59:14,551 INFO L130 PetriNetUnfolder]: For 8443/9729 co-relation queries the response was YES. [2021-03-25 23:59:14,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 2653 events. 1209/2653 cut-off events. For 8443/9729 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 22187 event pairs, 256 based on Foata normal form. 132/2649 useless extension candidates. Maximal degree in co-relation 12027. Up to 1735 conditions per place. [2021-03-25 23:59:14,579 INFO L132 encePairwiseOnDemand]: 201/213 looper letters, 29 selfloop transitions, 34 changer transitions 1/92 dead transitions. [2021-03-25 23:59:14,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 1040 flow [2021-03-25 23:59:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:59:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:59:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1008 transitions. [2021-03-25 23:59:14,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7887323943661971 [2021-03-25 23:59:14,582 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1008 transitions. [2021-03-25 23:59:14,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1008 transitions. [2021-03-25 23:59:14,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:14,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1008 transitions. [2021-03-25 23:59:14,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:14,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:14,586 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:14,587 INFO L185 Difference]: Start difference. First operand has 74 places, 66 transitions, 600 flow. Second operand 6 states and 1008 transitions. [2021-03-25 23:59:14,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 1040 flow [2021-03-25 23:59:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 1002 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 23:59:14,660 INFO L241 Difference]: Finished difference. Result has 76 places, 80 transitions, 879 flow [2021-03-25 23:59:14,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=879, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2021-03-25 23:59:14,660 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2021-03-25 23:59:14,660 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:14,660 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 879 flow [2021-03-25 23:59:14,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 879 flow [2021-03-25 23:59:14,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 879 flow [2021-03-25 23:59:14,888 INFO L129 PetriNetUnfolder]: 1186/2614 cut-off events. [2021-03-25 23:59:14,888 INFO L130 PetriNetUnfolder]: For 6698/7108 co-relation queries the response was YES. [2021-03-25 23:59:14,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9265 conditions, 2614 events. 1186/2614 cut-off events. For 6698/7108 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 22390 event pairs, 317 based on Foata normal form. 89/2565 useless extension candidates. Maximal degree in co-relation 9233. Up to 1585 conditions per place. [2021-03-25 23:59:14,928 INFO L142 LiptonReduction]: Number of co-enabled transitions 1388 [2021-03-25 23:59:15,937 INFO L154 LiptonReduction]: Checked pairs total: 1426 [2021-03-25 23:59:15,938 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:59:15,938 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1278 [2021-03-25 23:59:15,938 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 879 flow [2021-03-25 23:59:15,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:15,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:15,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:15,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 23:59:15,939 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1536704423, now seen corresponding path program 2 times [2021-03-25 23:59:15,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:15,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893621962] [2021-03-25 23:59:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:16,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:16,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:16,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:16,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:16,034 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 23:59:16,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:59:16,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:16,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:16,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:16,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:16,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893621962] [2021-03-25 23:59:16,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:16,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:59:16,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011595636] [2021-03-25 23:59:16,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 23:59:16,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 23:59:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 23:59:16,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2021-03-25 23:59:16,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 879 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:16,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:16,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2021-03-25 23:59:16,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:16,444 INFO L129 PetriNetUnfolder]: 1636/3267 cut-off events. [2021-03-25 23:59:16,445 INFO L130 PetriNetUnfolder]: For 7634/12175 co-relation queries the response was YES. [2021-03-25 23:59:16,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 3267 events. 1636/3267 cut-off events. For 7634/12175 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 26433 event pairs, 96 based on Foata normal form. 788/3680 useless extension candidates. Maximal degree in co-relation 12788. Up to 1977 conditions per place. [2021-03-25 23:59:16,484 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 10 selfloop transitions, 18 changer transitions 4/96 dead transitions. [2021-03-25 23:59:16,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 1051 flow [2021-03-25 23:59:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:59:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:59:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1273 transitions. [2021-03-25 23:59:16,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8537894030851777 [2021-03-25 23:59:16,487 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1273 transitions. [2021-03-25 23:59:16,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1273 transitions. [2021-03-25 23:59:16,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:16,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1273 transitions. [2021-03-25 23:59:16,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:16,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:16,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:16,493 INFO L185 Difference]: Start difference. First operand has 76 places, 80 transitions, 879 flow. Second operand 7 states and 1273 transitions. [2021-03-25 23:59:16,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 1051 flow [2021-03-25 23:59:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 96 transitions, 1030 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-25 23:59:16,510 INFO L241 Difference]: Finished difference. Result has 84 places, 89 transitions, 996 flow [2021-03-25 23:59:16,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=996, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2021-03-25 23:59:16,511 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2021-03-25 23:59:16,511 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:16,511 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 89 transitions, 996 flow [2021-03-25 23:59:16,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 89 transitions, 996 flow [2021-03-25 23:59:16,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 996 flow [2021-03-25 23:59:16,713 INFO L129 PetriNetUnfolder]: 828/2056 cut-off events. [2021-03-25 23:59:16,713 INFO L130 PetriNetUnfolder]: For 7430/7957 co-relation queries the response was YES. [2021-03-25 23:59:16,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9565 conditions, 2056 events. 828/2056 cut-off events. For 7430/7957 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 17683 event pairs, 90 based on Foata normal form. 3/1960 useless extension candidates. Maximal degree in co-relation 9529. Up to 1291 conditions per place. [2021-03-25 23:59:16,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 1564 [2021-03-25 23:59:18,679 INFO L154 LiptonReduction]: Checked pairs total: 3580 [2021-03-25 23:59:18,679 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:59:18,679 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2168 [2021-03-25 23:59:18,680 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 986 flow [2021-03-25 23:59:18,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:18,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:18,680 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:18,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 23:59:18,681 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:18,681 INFO L82 PathProgramCache]: Analyzing trace with hash 224809960, now seen corresponding path program 1 times [2021-03-25 23:59:18,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:18,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11293931] [2021-03-25 23:59:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:18,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:18,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 23:59:18,775 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-25 23:59:18,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 23:59:18,801 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-25 23:59:18,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 23:59:18,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:18,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 23:59:18,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:18,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:18,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11293931] [2021-03-25 23:59:18,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:18,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:59:18,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146062101] [2021-03-25 23:59:18,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:59:18,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:59:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:59:18,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 213 [2021-03-25 23:59:18,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 986 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:18,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:18,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 213 [2021-03-25 23:59:18,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:19,716 INFO L129 PetriNetUnfolder]: 3263/7266 cut-off events. [2021-03-25 23:59:19,717 INFO L130 PetriNetUnfolder]: For 23189/24866 co-relation queries the response was YES. [2021-03-25 23:59:19,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28443 conditions, 7266 events. 3263/7266 cut-off events. For 23189/24866 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 71119 event pairs, 382 based on Foata normal form. 13/6863 useless extension candidates. Maximal degree in co-relation 28405. Up to 3363 conditions per place. [2021-03-25 23:59:19,776 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 23 selfloop transitions, 15 changer transitions 6/110 dead transitions. [2021-03-25 23:59:19,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1188 flow [2021-03-25 23:59:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:59:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:59:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1143 transitions. [2021-03-25 23:59:19,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7665995975855131 [2021-03-25 23:59:19,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1143 transitions. [2021-03-25 23:59:19,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1143 transitions. [2021-03-25 23:59:19,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:19,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1143 transitions. [2021-03-25 23:59:19,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:19,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:19,785 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:19,785 INFO L185 Difference]: Start difference. First operand has 84 places, 88 transitions, 986 flow. Second operand 7 states and 1143 transitions. [2021-03-25 23:59:19,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1188 flow [2021-03-25 23:59:20,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 1131 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-25 23:59:20,270 INFO L241 Difference]: Finished difference. Result has 88 places, 93 transitions, 951 flow [2021-03-25 23:59:20,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=951, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2021-03-25 23:59:20,270 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2021-03-25 23:59:20,270 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:20,270 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 93 transitions, 951 flow [2021-03-25 23:59:20,270 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 93 transitions, 951 flow [2021-03-25 23:59:20,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 951 flow [2021-03-25 23:59:20,648 INFO L129 PetriNetUnfolder]: 2263/5221 cut-off events. [2021-03-25 23:59:20,648 INFO L130 PetriNetUnfolder]: For 11658/11843 co-relation queries the response was YES. [2021-03-25 23:59:20,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18664 conditions, 5221 events. 2263/5221 cut-off events. For 11658/11843 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 50437 event pairs, 258 based on Foata normal form. 6/4905 useless extension candidates. Maximal degree in co-relation 18625. Up to 2081 conditions per place. [2021-03-25 23:59:20,729 INFO L142 LiptonReduction]: Number of co-enabled transitions 1650 [2021-03-25 23:59:29,661 INFO L154 LiptonReduction]: Checked pairs total: 441 [2021-03-25 23:59:29,661 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:59:29,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9391 [2021-03-25 23:59:29,662 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 93 transitions, 951 flow [2021-03-25 23:59:29,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:29,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:29,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:29,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 23:59:29,663 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 997575576, now seen corresponding path program 2 times [2021-03-25 23:59:29,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:29,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186317527] [2021-03-25 23:59:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:29,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:29,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:29,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:29,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:29,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:29,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:29,770 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 23:59:29,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:59:29,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:29,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:59:29,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:29,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:59:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:29,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186317527] [2021-03-25 23:59:29,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:29,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 23:59:29,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192560313] [2021-03-25 23:59:29,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:59:29,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:59:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:59:29,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2021-03-25 23:59:29,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 951 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:29,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:29,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2021-03-25 23:59:29,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:30,620 INFO L129 PetriNetUnfolder]: 4887/9204 cut-off events. [2021-03-25 23:59:30,620 INFO L130 PetriNetUnfolder]: For 17891/25187 co-relation queries the response was YES. [2021-03-25 23:59:30,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35187 conditions, 9204 events. 4887/9204 cut-off events. For 17891/25187 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 83311 event pairs, 190 based on Foata normal form. 1398/9210 useless extension candidates. Maximal degree in co-relation 35146. Up to 3550 conditions per place. [2021-03-25 23:59:30,692 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 6 selfloop transitions, 18 changer transitions 19/101 dead transitions. [2021-03-25 23:59:30,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 101 transitions, 1064 flow [2021-03-25 23:59:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 23:59:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 23:59:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1447 transitions. [2021-03-25 23:59:30,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8491784037558685 [2021-03-25 23:59:30,696 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1447 transitions. [2021-03-25 23:59:30,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1447 transitions. [2021-03-25 23:59:30,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:30,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1447 transitions. [2021-03-25 23:59:30,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 180.875) internal successors, (1447), 8 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:30,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:30,703 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:30,703 INFO L185 Difference]: Start difference. First operand has 88 places, 93 transitions, 951 flow. Second operand 8 states and 1447 transitions. [2021-03-25 23:59:30,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 101 transitions, 1064 flow [2021-03-25 23:59:31,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 101 transitions, 1031 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-25 23:59:31,438 INFO L241 Difference]: Finished difference. Result has 95 places, 79 transitions, 783 flow [2021-03-25 23:59:31,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=783, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2021-03-25 23:59:31,438 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2021-03-25 23:59:31,438 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:31,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 79 transitions, 783 flow [2021-03-25 23:59:31,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 79 transitions, 783 flow [2021-03-25 23:59:31,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 79 transitions, 783 flow [2021-03-25 23:59:31,589 INFO L129 PetriNetUnfolder]: 647/1643 cut-off events. [2021-03-25 23:59:31,589 INFO L130 PetriNetUnfolder]: For 4039/4194 co-relation queries the response was YES. [2021-03-25 23:59:31,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 1643 events. 647/1643 cut-off events. For 4039/4194 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13596 event pairs, 113 based on Foata normal form. 3/1536 useless extension candidates. Maximal degree in co-relation 6737. Up to 612 conditions per place. [2021-03-25 23:59:31,618 INFO L142 LiptonReduction]: Number of co-enabled transitions 1108 [2021-03-25 23:59:32,078 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 23:59:32,217 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 23:59:32,705 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 23:59:32,859 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 23:59:33,012 INFO L154 LiptonReduction]: Checked pairs total: 1036 [2021-03-25 23:59:33,013 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 23:59:33,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1575 [2021-03-25 23:59:33,013 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 769 flow [2021-03-25 23:59:33,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:33,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:33,014 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:33,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 23:59:33,014 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2080063730, now seen corresponding path program 1 times [2021-03-25 23:59:33,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:33,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817430109] [2021-03-25 23:59:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:59:33,063 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:59:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:59:33,115 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:59:33,164 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 23:59:33,165 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 23:59:33,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 23:59:33,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 11:59:33 BasicIcfg [2021-03-25 23:59:33,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 23:59:33,291 INFO L168 Benchmark]: Toolchain (without parser) took 35654.32 ms. Allocated memory was 255.9 MB in the beginning and 1.1 GB in the end (delta: 796.9 MB). Free memory was 235.2 MB in the beginning and 758.4 MB in the end (delta: -523.2 MB). Peak memory consumption was 273.4 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,291 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 23:59:33,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.84 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.8 MB in the beginning and 298.2 MB in the end (delta: -63.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 339.7 MB. Free memory was 298.2 MB in the beginning and 295.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,294 INFO L168 Benchmark]: Boogie Preprocessor took 48.02 ms. Allocated memory is still 339.7 MB. Free memory was 295.5 MB in the beginning and 293.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,294 INFO L168 Benchmark]: RCFGBuilder took 1866.80 ms. Allocated memory is still 339.7 MB. Free memory was 293.1 MB in the beginning and 278.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 64.5 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,294 INFO L168 Benchmark]: TraceAbstraction took 33041.57 ms. Allocated memory was 339.7 MB in the beginning and 1.1 GB in the end (delta: 713.0 MB). Free memory was 277.4 MB in the beginning and 758.4 MB in the end (delta: -481.0 MB). Peak memory consumption was 233.0 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:33,301 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.46 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 619.84 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.8 MB in the beginning and 298.2 MB in the end (delta: -63.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 339.7 MB. Free memory was 298.2 MB in the beginning and 295.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.02 ms. Allocated memory is still 339.7 MB. Free memory was 295.5 MB in the beginning and 293.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1866.80 ms. Allocated memory is still 339.7 MB. Free memory was 293.1 MB in the beginning and 278.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 64.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 33041.57 ms. Allocated memory was 339.7 MB in the beginning and 1.1 GB in the end (delta: 713.0 MB). Free memory was 277.4 MB in the beginning and 758.4 MB in the end (delta: -481.0 MB). Peak memory consumption was 233.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3427.0ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2256, positive: 2134, positive conditional: 2134, positive unconditional: 0, negative: 122, negative conditional: 122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1734, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1734, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1734, positive: 1671, positive conditional: 0, positive unconditional: 1671, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 655, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 614, negative conditional: 0, negative unconditional: 614, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2256, positive: 450, positive conditional: 450, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 1734, unknown conditional: 1734, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1212.2ms, 58 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 35 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 646, positive: 514, positive conditional: 514, positive unconditional: 0, negative: 132, negative conditional: 132, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, positive: 158, positive conditional: 15, positive unconditional: 143, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 189, positive: 158, positive conditional: 15, positive unconditional: 143, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 189, positive: 155, positive conditional: 0, positive unconditional: 155, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 424, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 406, negative conditional: 35, negative unconditional: 371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 646, positive: 356, positive conditional: 356, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 189, unknown conditional: 189, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 874.9ms, 55 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 19, positive conditional: 4, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 19, positive conditional: 4, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 90, positive conditional: 90, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1219.2ms, 51 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 224, positive: 174, positive conditional: 174, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 8, positive unconditional: 22, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 8, positive unconditional: 22, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 157, negative conditional: 101, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 185, Positive conditional cache size: 185, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 90, positive conditional: 90, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 209, Positive conditional cache size: 209, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 679.6ms, 61 PlacesBefore, 61 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 39, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 39, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 0, positive unconditional: 43, 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: 241, positive: 138, positive conditional: 138, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 187, Positive conditional cache size: 187, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 456.8ms, 62 PlacesBefore, 62 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 4, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 214, Positive conditional cache size: 214, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1424.7ms, 67 PlacesBefore, 67 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1611 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 219, positive: 173, positive conditional: 173, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 19, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 19, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 0, positive unconditional: 36, 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: 219, positive: 137, positive conditional: 137, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 231, Positive conditional cache size: 231, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1317.0ms, 74 PlacesBefore, 74 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2061 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 215, positive: 165, positive conditional: 165, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 45, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 45, 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: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 215, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1277.2ms, 76 PlacesBefore, 76 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1426 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 266, positive: 234, positive conditional: 234, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 60, positive conditional: 35, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 60, positive conditional: 35, positive unconditional: 25, 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: 62, positive: 60, positive conditional: 0, positive unconditional: 60, 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: 61, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, positive: 174, positive conditional: 174, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 301, Positive conditional cache size: 301, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2167.8ms, 84 PlacesBefore, 84 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 331, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 71, positive conditional: 54, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, positive: 71, positive conditional: 54, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 331, positive: 186, positive conditional: 186, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 77, unknown conditional: 77, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 320, Positive conditional cache size: 320, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9391.0ms, 88 PlacesBefore, 88 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 441 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 111, positive conditional: 111, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 59, negative conditional: 59, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 348, Positive conditional cache size: 348, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1574.2ms, 95 PlacesBefore, 91 PlacesAfterwards, 79 TransitionsBefore, 76 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 436, positive: 406, positive conditional: 406, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 71, positive conditional: 59, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, positive: 71, positive conditional: 59, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, positive: 71, positive conditional: 0, positive unconditional: 71, 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: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 436, positive: 335, positive conditional: 335, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 73, unknown conditional: 73, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 371, Positive conditional cache size: 371, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 32775.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5933.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3518.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 105 SDtfs, 91 SDslu, 101 SDs, 0 SdLazy, 380 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 366.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 294.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=10, InterpolantAutomatonStates: 65, 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: 35.4ms SsaConstructionTime, 412.9ms SatisfiabilityAnalysisTime, 815.9ms InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1334 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...