/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/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:10:55,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:10:55,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:10:55,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:10:55,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:10:55,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:10:55,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:10:55,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:10:55,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:10:55,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:10:55,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:10:55,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:10:55,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:10:55,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:10:55,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:10:55,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:10:55,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:10:55,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:10:55,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:10:55,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:10:55,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:10:55,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:10:55,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:10:55,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:10:55,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:10:55,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:10:55,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:10:55,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:10:55,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:10:55,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:10:55,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:10:55,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:10:55,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:10:55,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:10:55,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:10:55,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:10:55,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:10:55,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:10:55,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:10:55,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:10:55,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:10:55,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:10:55,557 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:10:55,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:10:55,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:10:55,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:10:55,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:10:55,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:10:55,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:10:55,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:10:55,561 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:10:55,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:10:55,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:10:55,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:10:55,885 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:10:55,886 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:10:55,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2021-03-26 00:10:55,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac1d5417/0f46d1cd95c34357a2c3732b493b8c75/FLAGeeaa3e20b [2021-03-26 00:10:56,385 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:10:56,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2021-03-26 00:10:56,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac1d5417/0f46d1cd95c34357a2c3732b493b8c75/FLAGeeaa3e20b [2021-03-26 00:10:56,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac1d5417/0f46d1cd95c34357a2c3732b493b8c75 [2021-03-26 00:10:56,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:10:56,425 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:10:56,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:56,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:10:56,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:10:56,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3e782c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56, skipping insertion in model container [2021-03-26 00:10:56,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:10:56,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:10:56,633 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/mix025_pso.oepc.i[949,962] [2021-03-26 00:10:56,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:56,793 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:10:56,802 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/mix025_pso.oepc.i[949,962] [2021-03-26 00:10:56,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:56,903 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:10:56,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56 WrapperNode [2021-03-26 00:10:56,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:56,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:56,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:10:56,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:10:56,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:56,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:10:56,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:10:56,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:10:56,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... [2021-03-26 00:10:56,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:10:56,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:10:56,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:10:56,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:10:56,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:10:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:10:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:10:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:10:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:10:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:10:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:10:57,018 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:10:58,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:10:58,466 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:10:58,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:58 BoogieIcfgContainer [2021-03-26 00:10:58,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:10:58,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:10:58,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:10:58,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:10:58,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:10:56" (1/3) ... [2021-03-26 00:10:58,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e13b2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:58, skipping insertion in model container [2021-03-26 00:10:58,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:56" (2/3) ... [2021-03-26 00:10:58,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e13b2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:58, skipping insertion in model container [2021-03-26 00:10:58,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:58" (3/3) ... [2021-03-26 00:10:58,483 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2021-03-26 00:10:58,487 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:10:58,492 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:10:58,492 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:58,549 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:10:58,561 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:10:58,573 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:10:58,573 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:10:58,573 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:10:58,573 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:10:58,574 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:10:58,574 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:10:58,574 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:10:58,574 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:10:58,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 00:10:58,602 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 00:10:58,602 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:58,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:10:58,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 00:10:58,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 00:10:58,609 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:58,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 00:10:58,618 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 00:10:58,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 00:10:58,630 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 00:10:58,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:58,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:10:58,632 INFO L142 LiptonReduction]: Number of co-enabled transitions 1778 [2021-03-26 00:10:59,669 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:11:00,044 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:11:00,189 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:11:01,259 INFO L154 LiptonReduction]: Checked pairs total: 3086 [2021-03-26 00:11:01,259 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:11:01,264 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2656 [2021-03-26 00:11:01,273 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:11:01,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:01,274 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:01,274 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:01,275 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:01,279 INFO L82 PathProgramCache]: Analyzing trace with hash 699704113, now seen corresponding path program 1 times [2021-03-26 00:11:01,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:01,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907438967] [2021-03-26 00:11:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:01,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:01,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:01,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:01,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:01,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907438967] [2021-03-26 00:11:01,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:01,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:11:01,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411354053] [2021-03-26 00:11:01,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:01,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:01,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 164 [2021-03-26 00:11:01,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:01,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:01,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 164 [2021-03-26 00:11:01,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:01,616 INFO L129 PetriNetUnfolder]: 49/143 cut-off events. [2021-03-26 00:11:01,616 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:01,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 143 events. 49/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 571 event pairs, 38 based on Foata normal form. 17/151 useless extension candidates. Maximal degree in co-relation 219. Up to 65 conditions per place. [2021-03-26 00:11:01,619 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 9 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 00:11:01,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 115 flow [2021-03-26 00:11:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 00:11:01,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9065040650406504 [2021-03-26 00:11:01,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 00:11:01,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 00:11:01,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:01,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 00:11:01,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:01,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:01,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:01,648 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 446 transitions. [2021-03-26 00:11:01,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 115 flow [2021-03-26 00:11:01,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:11:01,652 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-26 00:11:01,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 00:11:01,653 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:11:01,654 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:01,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:11:01,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:11:01,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-26 00:11:01,661 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 00:11:01,661 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:01,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:11:01,662 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:11:02,102 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:11:02,233 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:11:03,129 INFO L154 LiptonReduction]: Checked pairs total: 1610 [2021-03-26 00:11:03,129 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:11:03,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1476 [2021-03-26 00:11:03,131 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 00:11:03,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:03,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:03,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:03,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:11:03,132 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1973046455, now seen corresponding path program 1 times [2021-03-26 00:11:03,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:03,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379585022] [2021-03-26 00:11:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:03,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:03,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:03,217 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:11:03,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:11:03,226 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:11:03,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:11:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:03,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379585022] [2021-03-26 00:11:03,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:03,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:03,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495008569] [2021-03-26 00:11:03,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:03,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:03,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 177 [2021-03-26 00:11:03,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:03,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:03,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 177 [2021-03-26 00:11:03,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:03,296 INFO L129 PetriNetUnfolder]: 82/233 cut-off events. [2021-03-26 00:11:03,296 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:03,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 233 events. 82/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1260 event pairs, 12 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2021-03-26 00:11:03,298 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 6 selfloop transitions, 6 changer transitions 12/41 dead transitions. [2021-03-26 00:11:03,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 140 flow [2021-03-26 00:11:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-03-26 00:11:03,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248587570621468 [2021-03-26 00:11:03,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-03-26 00:11:03,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-03-26 00:11:03,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:03,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-03-26 00:11:03,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:03,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:03,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:03,304 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 730 transitions. [2021-03-26 00:11:03,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 140 flow [2021-03-26 00:11:03,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:03,305 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 110 flow [2021-03-26 00:11:03,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 00:11:03,306 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 00:11:03,306 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:03,306 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 00:11:03,306 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 00:11:03,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 110 flow [2021-03-26 00:11:03,323 INFO L129 PetriNetUnfolder]: 38/143 cut-off events. [2021-03-26 00:11:03,324 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-03-26 00:11:03,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 143 events. 38/143 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 719 event pairs, 10 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 291. Up to 67 conditions per place. [2021-03-26 00:11:03,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 00:11:04,100 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 00:11:04,241 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:11:04,548 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 00:11:04,682 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:11:04,686 INFO L154 LiptonReduction]: Checked pairs total: 813 [2021-03-26 00:11:04,686 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:11:04,687 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1381 [2021-03-26 00:11:04,687 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 106 flow [2021-03-26 00:11:04,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:04,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:04,688 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:04,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:11:04,688 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -458321849, now seen corresponding path program 1 times [2021-03-26 00:11:04,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:04,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741778098] [2021-03-26 00:11:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:04,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:04,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:04,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741778098] [2021-03-26 00:11:04,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:04,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:11:04,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476991058] [2021-03-26 00:11:04,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:04,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:04,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 179 [2021-03-26 00:11:04,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:04,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:04,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 179 [2021-03-26 00:11:04,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:04,742 INFO L129 PetriNetUnfolder]: 26/114 cut-off events. [2021-03-26 00:11:04,742 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-03-26 00:11:04,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 114 events. 26/114 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 9 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 242. Up to 49 conditions per place. [2021-03-26 00:11:04,743 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 1 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 00:11:04,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 114 flow [2021-03-26 00:11:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 00:11:04,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8901303538175046 [2021-03-26 00:11:04,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 00:11:04,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 00:11:04,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:04,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 00:11:04,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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-26 00:11:04,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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-26 00:11:04,746 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 106 flow. Second operand 3 states and 478 transitions. [2021-03-26 00:11:04,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 114 flow [2021-03-26 00:11:04,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 92 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 00:11:04,748 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2021-03-26 00:11:04,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2021-03-26 00:11:04,748 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:11:04,748 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:04,748 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 95 flow [2021-03-26 00:11:04,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 95 flow [2021-03-26 00:11:04,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 95 flow [2021-03-26 00:11:04,757 INFO L129 PetriNetUnfolder]: 26/110 cut-off events. [2021-03-26 00:11:04,757 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-03-26 00:11:04,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 110 events. 26/110 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 12 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 192. Up to 49 conditions per place. [2021-03-26 00:11:04,758 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 00:11:04,971 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-26 00:11:04,972 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:04,972 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 224 [2021-03-26 00:11:04,976 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2021-03-26 00:11:04,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:04,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:04,977 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:04,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:11:04,977 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2119533396, now seen corresponding path program 1 times [2021-03-26 00:11:04,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:04,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068159277] [2021-03-26 00:11:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:05,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:11:05,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:05,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068159277] [2021-03-26 00:11:05,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:05,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:05,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199716536] [2021-03-26 00:11:05,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:05,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:05,071 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 00:11:05,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:05,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 00:11:05,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:05,126 INFO L129 PetriNetUnfolder]: 118/309 cut-off events. [2021-03-26 00:11:05,126 INFO L130 PetriNetUnfolder]: For 21/36 co-relation queries the response was YES. [2021-03-26 00:11:05,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 309 events. 118/309 cut-off events. For 21/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1893 event pairs, 45 based on Foata normal form. 28/314 useless extension candidates. Maximal degree in co-relation 620. Up to 165 conditions per place. [2021-03-26 00:11:05,128 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 00:11:05,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 147 flow [2021-03-26 00:11:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-26 00:11:05,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8636871508379889 [2021-03-26 00:11:05,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-26 00:11:05,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-26 00:11:05,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:05,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-26 00:11:05,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,135 INFO L185 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 773 transitions. [2021-03-26 00:11:05,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 147 flow [2021-03-26 00:11:05,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:05,138 INFO L241 Difference]: Finished difference. Result has 39 places, 34 transitions, 149 flow [2021-03-26 00:11:05,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2021-03-26 00:11:05,139 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-26 00:11:05,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:05,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 149 flow [2021-03-26 00:11:05,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 149 flow [2021-03-26 00:11:05,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 149 flow [2021-03-26 00:11:05,168 INFO L129 PetriNetUnfolder]: 133/352 cut-off events. [2021-03-26 00:11:05,168 INFO L130 PetriNetUnfolder]: For 198/250 co-relation queries the response was YES. [2021-03-26 00:11:05,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 352 events. 133/352 cut-off events. For 198/250 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2298 event pairs, 57 based on Foata normal form. 6/330 useless extension candidates. Maximal degree in co-relation 907. Up to 195 conditions per place. [2021-03-26 00:11:05,172 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-26 00:11:05,224 INFO L154 LiptonReduction]: Checked pairs total: 517 [2021-03-26 00:11:05,224 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:05,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-26 00:11:05,227 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 143 flow [2021-03-26 00:11:05,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:05,227 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:05,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:11:05,227 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 31464797, now seen corresponding path program 1 times [2021-03-26 00:11:05,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:05,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040873532] [2021-03-26 00:11:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:05,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:11:05,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:05,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040873532] [2021-03-26 00:11:05,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:05,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:11:05,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950368609] [2021-03-26 00:11:05,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:11:05,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:11:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:11:05,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 00:11:05,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:05,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 00:11:05,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:05,407 INFO L129 PetriNetUnfolder]: 59/194 cut-off events. [2021-03-26 00:11:05,407 INFO L130 PetriNetUnfolder]: For 172/253 co-relation queries the response was YES. [2021-03-26 00:11:05,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 194 events. 59/194 cut-off events. For 172/253 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1013 event pairs, 6 based on Foata normal form. 53/243 useless extension candidates. Maximal degree in co-relation 600. Up to 112 conditions per place. [2021-03-26 00:11:05,409 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 11 changer transitions 3/40 dead transitions. [2021-03-26 00:11:05,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 221 flow [2021-03-26 00:11:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:11:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:11:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2021-03-26 00:11:05,411 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631284916201117 [2021-03-26 00:11:05,411 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2021-03-26 00:11:05,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2021-03-26 00:11:05,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:05,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2021-03-26 00:11:05,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,415 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,415 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 143 flow. Second operand 6 states and 927 transitions. [2021-03-26 00:11:05,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 221 flow [2021-03-26 00:11:05,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 215 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:05,419 INFO L241 Difference]: Finished difference. Result has 43 places, 37 transitions, 207 flow [2021-03-26 00:11:05,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2021-03-26 00:11:05,419 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2021-03-26 00:11:05,420 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:05,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 207 flow [2021-03-26 00:11:05,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 207 flow [2021-03-26 00:11:05,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 207 flow [2021-03-26 00:11:05,437 INFO L129 PetriNetUnfolder]: 58/211 cut-off events. [2021-03-26 00:11:05,437 INFO L130 PetriNetUnfolder]: For 377/424 co-relation queries the response was YES. [2021-03-26 00:11:05,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 211 events. 58/211 cut-off events. For 377/424 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1208 event pairs, 10 based on Foata normal form. 1/207 useless extension candidates. Maximal degree in co-relation 703. Up to 124 conditions per place. [2021-03-26 00:11:05,439 INFO L142 LiptonReduction]: Number of co-enabled transitions 406 [2021-03-26 00:11:05,447 INFO L154 LiptonReduction]: Checked pairs total: 598 [2021-03-26 00:11:05,447 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:05,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-26 00:11:05,450 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 199 flow [2021-03-26 00:11:05,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:05,450 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:05,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:11:05,451 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash -625719803, now seen corresponding path program 1 times [2021-03-26 00:11:05,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:05,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528528362] [2021-03-26 00:11:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:05,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:05,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:11:05,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:05,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:05,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528528362] [2021-03-26 00:11:05,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:05,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:11:05,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879942425] [2021-03-26 00:11:05,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:11:05,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:11:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:11:05,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 00:11:05,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:05,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 00:11:05,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:05,609 INFO L129 PetriNetUnfolder]: 33/122 cut-off events. [2021-03-26 00:11:05,609 INFO L130 PetriNetUnfolder]: For 234/280 co-relation queries the response was YES. [2021-03-26 00:11:05,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 122 events. 33/122 cut-off events. For 234/280 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 502 event pairs, 0 based on Foata normal form. 37/157 useless extension candidates. Maximal degree in co-relation 415. Up to 62 conditions per place. [2021-03-26 00:11:05,610 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 11 changer transitions 3/37 dead transitions. [2021-03-26 00:11:05,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 231 flow [2021-03-26 00:11:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:11:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:11:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1075 transitions. [2021-03-26 00:11:05,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8579409417398244 [2021-03-26 00:11:05,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1075 transitions. [2021-03-26 00:11:05,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1075 transitions. [2021-03-26 00:11:05,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:05,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1075 transitions. [2021-03-26 00:11:05,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,616 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:05,616 INFO L185 Difference]: Start difference. First operand has 43 places, 36 transitions, 199 flow. Second operand 7 states and 1075 transitions. [2021-03-26 00:11:05,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 231 flow [2021-03-26 00:11:05,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 206 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 00:11:05,618 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 186 flow [2021-03-26 00:11:05,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 00:11:05,619 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2021-03-26 00:11:05,619 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:05,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 186 flow [2021-03-26 00:11:05,619 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 186 flow [2021-03-26 00:11:05,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 186 flow [2021-03-26 00:11:05,630 INFO L129 PetriNetUnfolder]: 31/130 cut-off events. [2021-03-26 00:11:05,631 INFO L130 PetriNetUnfolder]: For 171/175 co-relation queries the response was YES. [2021-03-26 00:11:05,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 130 events. 31/130 cut-off events. For 171/175 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 599 event pairs, 4 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 395. Up to 42 conditions per place. [2021-03-26 00:11:05,632 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-26 00:11:05,916 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:11:06,052 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:11:06,364 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:11:06,514 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:11:06,519 INFO L154 LiptonReduction]: Checked pairs total: 560 [2021-03-26 00:11:06,519 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:11:06,519 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 900 [2021-03-26 00:11:06,520 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 172 flow [2021-03-26 00:11:06,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:06,520 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:06,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:11:06,520 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1856780908, now seen corresponding path program 1 times [2021-03-26 00:11:06,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:06,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621833184] [2021-03-26 00:11:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:06,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:06,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:06,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:06,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:06,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:06,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:06,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621833184] [2021-03-26 00:11:06,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:06,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:06,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524927489] [2021-03-26 00:11:06,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:06,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:06,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 181 [2021-03-26 00:11:06,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:06,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 181 [2021-03-26 00:11:06,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:06,656 INFO L129 PetriNetUnfolder]: 46/154 cut-off events. [2021-03-26 00:11:06,656 INFO L130 PetriNetUnfolder]: For 682/720 co-relation queries the response was YES. [2021-03-26 00:11:06,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 154 events. 46/154 cut-off events. For 682/720 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 745 event pairs, 0 based on Foata normal form. 22/172 useless extension candidates. Maximal degree in co-relation 470. Up to 51 conditions per place. [2021-03-26 00:11:06,657 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 4 selfloop transitions, 1 changer transitions 3/33 dead transitions. [2021-03-26 00:11:06,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 194 flow [2021-03-26 00:11:06,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:11:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:11:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2021-03-26 00:11:06,659 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8535911602209945 [2021-03-26 00:11:06,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2021-03-26 00:11:06,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2021-03-26 00:11:06,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:06,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2021-03-26 00:11:06,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,662 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 172 flow. Second operand 4 states and 618 transitions. [2021-03-26 00:11:06,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 194 flow [2021-03-26 00:11:06,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 152 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:11:06,665 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 135 flow [2021-03-26 00:11:06,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-26 00:11:06,665 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 00:11:06,666 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:06,666 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 135 flow [2021-03-26 00:11:06,666 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 135 flow [2021-03-26 00:11:06,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 135 flow [2021-03-26 00:11:06,673 INFO L129 PetriNetUnfolder]: 20/85 cut-off events. [2021-03-26 00:11:06,673 INFO L130 PetriNetUnfolder]: For 67/75 co-relation queries the response was YES. [2021-03-26 00:11:06,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 85 events. 20/85 cut-off events. For 67/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 337 event pairs, 0 based on Foata normal form. 7/89 useless extension candidates. Maximal degree in co-relation 193. Up to 22 conditions per place. [2021-03-26 00:11:06,674 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 00:11:06,700 INFO L154 LiptonReduction]: Checked pairs total: 346 [2021-03-26 00:11:06,700 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:06,700 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 00:11:06,701 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 133 flow [2021-03-26 00:11:06,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:06,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:06,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:11:06,701 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash 839697422, now seen corresponding path program 1 times [2021-03-26 00:11:06,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:06,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798436826] [2021-03-26 00:11:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:06,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:06,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:06,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:06,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:06,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798436826] [2021-03-26 00:11:06,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:06,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:11:06,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991150487] [2021-03-26 00:11:06,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:06,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:06,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2021-03-26 00:11:06,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:06,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2021-03-26 00:11:06,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:06,781 INFO L129 PetriNetUnfolder]: 23/93 cut-off events. [2021-03-26 00:11:06,781 INFO L130 PetriNetUnfolder]: For 149/167 co-relation queries the response was YES. [2021-03-26 00:11:06,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 93 events. 23/93 cut-off events. For 149/167 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 0 based on Foata normal form. 10/101 useless extension candidates. Maximal degree in co-relation 236. Up to 26 conditions per place. [2021-03-26 00:11:06,782 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-26 00:11:06,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 153 flow [2021-03-26 00:11:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2021-03-26 00:11:06,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8663003663003663 [2021-03-26 00:11:06,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2021-03-26 00:11:06,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2021-03-26 00:11:06,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:06,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2021-03-26 00:11:06,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:06,786 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 133 flow. Second operand 3 states and 473 transitions. [2021-03-26 00:11:06,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 153 flow [2021-03-26 00:11:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 150 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:06,787 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 120 flow [2021-03-26 00:11:06,787 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 00:11:06,787 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-26 00:11:06,787 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:06,787 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 120 flow [2021-03-26 00:11:06,787 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 120 flow [2021-03-26 00:11:06,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 120 flow [2021-03-26 00:11:06,791 INFO L129 PetriNetUnfolder]: 5/28 cut-off events. [2021-03-26 00:11:06,792 INFO L130 PetriNetUnfolder]: For 63/76 co-relation queries the response was YES. [2021-03-26 00:11:06,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 28 events. 5/28 cut-off events. For 63/76 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/31 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2021-03-26 00:11:06,792 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 00:11:07,695 WARN L205 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-26 00:11:07,959 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:11:09,194 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 304 DAG size of output: 259 [2021-03-26 00:11:09,781 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:11:09,919 INFO L154 LiptonReduction]: Checked pairs total: 283 [2021-03-26 00:11:09,920 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:11:09,920 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3133 [2021-03-26 00:11:09,920 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 110 flow [2021-03-26 00:11:09,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:09,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:09,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:09,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:11:09,921 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:09,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1049917414, now seen corresponding path program 1 times [2021-03-26 00:11:09,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:09,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137622396] [2021-03-26 00:11:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:11:09,953 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:11:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:11:09,978 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:11:10,009 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:11:10,010 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:11:10,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:11:10,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:11:10 BasicIcfg [2021-03-26 00:11:10,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:11:10,094 INFO L168 Benchmark]: Toolchain (without parser) took 13662.20 ms. Allocated memory was 348.1 MB in the beginning and 771.8 MB in the end (delta: 423.6 MB). Free memory was 311.1 MB in the beginning and 607.0 MB in the end (delta: -295.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,094 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 348.1 MB. Free memory was 329.3 MB in the beginning and 329.1 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:11:10,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.69 ms. Allocated memory is still 348.1 MB. Free memory was 310.9 MB in the beginning and 308.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 348.1 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,096 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 348.1 MB. Free memory was 305.0 MB in the beginning and 302.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,097 INFO L168 Benchmark]: RCFGBuilder took 1509.78 ms. Allocated memory is still 348.1 MB. Free memory was 302.5 MB in the beginning and 252.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,097 INFO L168 Benchmark]: TraceAbstraction took 11612.26 ms. Allocated memory was 348.1 MB in the beginning and 771.8 MB in the end (delta: 423.6 MB). Free memory was 251.2 MB in the beginning and 607.0 MB in the end (delta: -355.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:10,101 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.19 ms. Allocated memory is still 348.1 MB. Free memory was 329.3 MB in the beginning and 329.1 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 475.69 ms. Allocated memory is still 348.1 MB. Free memory was 310.9 MB in the beginning and 308.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 348.1 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 348.1 MB. Free memory was 305.0 MB in the beginning and 302.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1509.78 ms. Allocated memory is still 348.1 MB. Free memory was 302.5 MB in the beginning and 252.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11612.26 ms. Allocated memory was 348.1 MB in the beginning and 771.8 MB in the end (delta: 423.6 MB). Free memory was 251.2 MB in the beginning and 607.0 MB in the end (delta: -355.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2641.1ms, 105 PlacesBefore, 50 PlacesAfterwards, 97 TransitionsBefore, 41 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3086 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1597, positive: 1518, positive conditional: 1518, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1246, positive: 1206, positive conditional: 0, positive unconditional: 1206, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1246, positive: 1206, positive conditional: 0, positive unconditional: 1206, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1246, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 530, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 515, negative conditional: 0, negative unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1597, positive: 312, positive conditional: 312, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 1246, unknown conditional: 1246, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 81, Positive conditional cache size: 81, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1475.0ms, 47 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 25 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1610 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 506, positive: 405, positive conditional: 405, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, positive: 140, positive conditional: 11, positive unconditional: 129, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, positive: 140, positive conditional: 11, positive unconditional: 129, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 298, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 269, negative conditional: 24, negative unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 506, positive: 265, positive conditional: 265, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 168, unknown conditional: 168, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 111, Positive conditional cache size: 111, 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: 1380.0ms, 40 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 813 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 244, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 7, negative conditional: 6, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 7, negative conditional: 6, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 29, positive conditional: 0, positive unconditional: 29, 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: 6, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 252, negative conditional: 249, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 244, positive: 167, positive conditional: 167, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 140, Positive conditional cache size: 140, 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: 222.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 18, positive conditional: 2, positive unconditional: 16, 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: 25, positive: 18, positive conditional: 2, positive unconditional: 16, 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: 25, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 211, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 158, Positive conditional cache size: 158, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.0ms, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 59, positive conditional: 59, 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: 26, positive: 24, positive conditional: 19, positive unconditional: 5, 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: 26, positive: 24, positive conditional: 19, positive unconditional: 5, 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: 26, positive: 24, positive conditional: 0, positive unconditional: 24, 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: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 165, Positive conditional cache size: 165, 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: 27.2ms, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 598 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 24, 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: 26, positive: 26, positive conditional: 24, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 175, Positive conditional cache size: 175, 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: 899.9ms, 46 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.3ms, 40 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 346 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 8, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 8, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 46, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 117, Positive conditional cache size: 117, 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: 3132.2ms, 39 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 18, positive unconditional: 6, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 18, positive unconditional: 6, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 135, negative conditional: 135, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t663; [L839] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t664; [L841] FCALL, FORK 0 pthread_create(&t664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t665; [L843] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11439.5ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 495.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2696.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 39 SDtfs, 21 SDslu, 19 SDs, 0 SdLazy, 119 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=5, InterpolantAutomatonStates: 36, 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: 25.5ms SsaConstructionTime, 333.1ms SatisfiabilityAnalysisTime, 397.2ms InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...