/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:11:04,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:11:04,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:11:04,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:11:04,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:11:04,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:11:04,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:11:04,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:11:04,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:11:04,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:11:04,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:11:04,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:11:04,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:11:04,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:11:04,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:11:04,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:11:04,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:11:04,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:11:04,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:11:04,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:11:04,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:11:04,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:11:04,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:11:04,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:11:04,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:11:04,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:11:04,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:11:04,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:11:04,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:11:04,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:11:04,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:11:04,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:11:04,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:11:04,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:11:04,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:11:04,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:11:04,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:11:04,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:11:04,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:11:04,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:11:04,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:11:04,970 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:11:05,010 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:11:05,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:11:05,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:11:05,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:11:05,014 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:11:05,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:11:05,015 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:11:05,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:11:05,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:11:05,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:11:05,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:11:05,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:11:05,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:11:05,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:11:05,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:11:05,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:11:05,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:11:05,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:11:05,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:11:05,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:11:05,019 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:11:05,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:11:05,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:11:05,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:11:05,402 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:11:05,403 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:11:05,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-03-26 00:11:05,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d37a6e9/2314261fda3d41c18fda949b3c2cff61/FLAGf3d592f4d [2021-03-26 00:11:06,072 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:11:06,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-03-26 00:11:06,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d37a6e9/2314261fda3d41c18fda949b3c2cff61/FLAGf3d592f4d [2021-03-26 00:11:06,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d37a6e9/2314261fda3d41c18fda949b3c2cff61 [2021-03-26 00:11:06,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:11:06,357 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:11:06,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:11:06,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:11:06,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:11:06,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:11:06" (1/1) ... [2021-03-26 00:11:06,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1430939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:06, skipping insertion in model container [2021-03-26 00:11:06,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:11:06" (1/1) ... [2021-03-26 00:11:06,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:11:06,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:11:06,636 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_rmo.opt.i[991,1004] [2021-03-26 00:11:06,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:11:06,884 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:11:06,897 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_rmo.opt.i[991,1004] [2021-03-26 00:11:06,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:11:07,026 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:11:07,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07 WrapperNode [2021-03-26 00:11:07,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:11:07,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:11:07,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:11:07,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:11:07,036 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:11:07" (1/1) ... [2021-03-26 00:11:07,070 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:11:07" (1/1) ... [2021-03-26 00:11:07,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:11:07,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:11:07,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:11:07,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:11:07,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (1/1) ... [2021-03-26 00:11:07,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:11:07,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:11:07,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:11:07,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:11:07,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (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:11:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:11:07,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:11:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:11:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:11:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:11:07,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:11:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:11:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:11:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:11:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:11:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:11:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:11:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:11:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:11:07,250 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:11:08,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:11:08,926 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:11:08,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:11:08 BoogieIcfgContainer [2021-03-26 00:11:08,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:11:08,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:11:08,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:11:08,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:11:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:11:06" (1/3) ... [2021-03-26 00:11:08,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4614d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:11:08, skipping insertion in model container [2021-03-26 00:11:08,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:11:07" (2/3) ... [2021-03-26 00:11:08,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4614d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:11:08, skipping insertion in model container [2021-03-26 00:11:08,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:11:08" (3/3) ... [2021-03-26 00:11:08,937 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2021-03-26 00:11:08,943 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:11:08,948 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:11:08,949 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:11:08,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:08,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,010 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:11:09,038 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:11:09,055 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:11:09,085 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:11:09,086 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:11:09,086 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:11:09,086 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:11:09,086 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:11:09,086 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:11:09,086 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:11:09,086 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:11:09,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 00:11:09,148 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 00:11:09,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:09,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:11:09,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 00:11:09,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-26 00:11:09,159 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:09,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 00:11:09,174 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 00:11:09,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-26 00:11:09,208 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 00:11:09,208 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:09,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:11:09,214 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 00:11:10,406 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:11:10,835 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:11:10,996 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:11:12,332 INFO L154 LiptonReduction]: Checked pairs total: 2604 [2021-03-26 00:11:12,333 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 00:11:12,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3183 [2021-03-26 00:11:12,354 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 00:11:12,354 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:12,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:12,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:12,357 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash 523136103, now seen corresponding path program 1 times [2021-03-26 00:11:12,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:12,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694315716] [2021-03-26 00:11:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:12,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:12,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:12,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:12,678 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:12,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694315716] [2021-03-26 00:11:12,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:12,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:11:12,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913597269] [2021-03-26 00:11:12,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:12,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:12,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 162 [2021-03-26 00:11:12,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 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:12,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:12,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 162 [2021-03-26 00:11:12,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:12,802 INFO L129 PetriNetUnfolder]: 29/111 cut-off events. [2021-03-26 00:11:12,802 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:12,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 111 events. 29/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 405 event pairs, 5 based on Foata normal form. 10/109 useless extension candidates. Maximal degree in co-relation 156. Up to 41 conditions per place. [2021-03-26 00:11:12,806 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 7 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-26 00:11:12,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 105 flow [2021-03-26 00:11:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2021-03-26 00:11:12,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2021-03-26 00:11:12,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2021-03-26 00:11:12,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2021-03-26 00:11:12,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:12,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2021-03-26 00:11:12,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:12,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:12,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:12,849 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 444 transitions. [2021-03-26 00:11:12,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 105 flow [2021-03-26 00:11:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:11:12,854 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 82 flow [2021-03-26 00:11:12,855 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-26 00:11:12,856 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:11:12,856 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:12,857 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 00:11:12,858 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 00:11:12,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-26 00:11:12,870 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 00:11:12,870 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:12,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:11:12,871 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-26 00:11:13,850 INFO L154 LiptonReduction]: Checked pairs total: 1032 [2021-03-26 00:11:13,850 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:11:13,851 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 995 [2021-03-26 00:11:13,853 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-26 00:11:13,853 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:13,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:13,853 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:13,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:11:13,854 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1950453156, now seen corresponding path program 1 times [2021-03-26 00:11:13,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:13,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535436873] [2021-03-26 00:11:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:13,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:13,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:13,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:13,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:13,981 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:11:13,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:11:13,986 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:13,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535436873] [2021-03-26 00:11:13,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:13,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:13,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712469242] [2021-03-26 00:11:13,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:13,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:13,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:13,989 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:11:13,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 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:13,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:13,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:11:13,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:14,016 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2021-03-26 00:11:14,016 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:14,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 35. Up to 3 conditions per place. [2021-03-26 00:11:14,017 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 1 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2021-03-26 00:11:14,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 78 flow [2021-03-26 00:11:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 762 transitions. [2021-03-26 00:11:14,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8809248554913295 [2021-03-26 00:11:14,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 762 transitions. [2021-03-26 00:11:14,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 762 transitions. [2021-03-26 00:11:14,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:14,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 762 transitions. [2021-03-26 00:11:14,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.4) internal successors, (762), 5 states have internal predecessors, (762), 0 states have call successors, (0), 0 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:14,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:14,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:14,025 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 762 transitions. [2021-03-26 00:11:14,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 78 flow [2021-03-26 00:11:14,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:14,026 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 60 flow [2021-03-26 00:11:14,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2021-03-26 00:11:14,027 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2021-03-26 00:11:14,027 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:14,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 60 flow [2021-03-26 00:11:14,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 60 flow [2021-03-26 00:11:14,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:11:14,030 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:11:14,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:14,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:11:14,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-26 00:11:14,697 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 00:11:14,845 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:11:15,198 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 00:11:15,350 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:11:15,354 INFO L154 LiptonReduction]: Checked pairs total: 738 [2021-03-26 00:11:15,355 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:11:15,355 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1328 [2021-03-26 00:11:15,356 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:11:15,357 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:15,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:15,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:15,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:11:15,357 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash 319694081, now seen corresponding path program 1 times [2021-03-26 00:11:15,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:15,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480926932] [2021-03-26 00:11:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:15,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:15,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:15,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:15,446 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:15,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480926932] [2021-03-26 00:11:15,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:15,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:15,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158337584] [2021-03-26 00:11:15,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:15,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:15,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-26 00:11:15,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:15,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:15,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-26 00:11:15,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:15,495 INFO L129 PetriNetUnfolder]: 28/79 cut-off events. [2021-03-26 00:11:15,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:15,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 79 events. 28/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 288 event pairs, 12 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 147. Up to 45 conditions per place. [2021-03-26 00:11:15,496 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 4 changer transitions 7/31 dead transitions. [2021-03-26 00:11:15,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 108 flow [2021-03-26 00:11:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-03-26 00:11:15,498 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8605714285714285 [2021-03-26 00:11:15,499 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-03-26 00:11:15,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-03-26 00:11:15,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:15,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-03-26 00:11:15,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 0 states have call successors, (0), 0 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:15,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:15,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:15,504 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 5 states and 753 transitions. [2021-03-26 00:11:15,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 108 flow [2021-03-26 00:11:15,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:15,505 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 88 flow [2021-03-26 00:11:15,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-26 00:11:15,506 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 00:11:15,506 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:15,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 88 flow [2021-03-26 00:11:15,506 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 88 flow [2021-03-26 00:11:15,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 88 flow [2021-03-26 00:11:15,517 INFO L129 PetriNetUnfolder]: 23/66 cut-off events. [2021-03-26 00:11:15,517 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 00:11:15,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 66 events. 23/66 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 212 event pairs, 11 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 157. Up to 38 conditions per place. [2021-03-26 00:11:15,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 228 [2021-03-26 00:11:15,611 INFO L154 LiptonReduction]: Checked pairs total: 217 [2021-03-26 00:11:15,611 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:15,611 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-03-26 00:11:15,612 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 88 flow [2021-03-26 00:11:15,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:15,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:15,613 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:15,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:11:15,613 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1194427828, now seen corresponding path program 1 times [2021-03-26 00:11:15,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:15,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472662868] [2021-03-26 00:11:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:15,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:15,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:15,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:15,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:15,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:15,753 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:15,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472662868] [2021-03-26 00:11:15,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:15,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:11:15,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876441443] [2021-03-26 00:11:15,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:11:15,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:15,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:11:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:11:15,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-26 00:11:15,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:15,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:15,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-26 00:11:15,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:15,805 INFO L129 PetriNetUnfolder]: 16/57 cut-off events. [2021-03-26 00:11:15,805 INFO L130 PetriNetUnfolder]: For 43/58 co-relation queries the response was YES. [2021-03-26 00:11:15,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 57 events. 16/57 cut-off events. For 43/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 154 event pairs, 2 based on Foata normal form. 13/69 useless extension candidates. Maximal degree in co-relation 171. Up to 35 conditions per place. [2021-03-26 00:11:15,808 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 7 changer transitions 7/34 dead transitions. [2021-03-26 00:11:15,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 184 flow [2021-03-26 00:11:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:11:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:11:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2021-03-26 00:11:15,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86 [2021-03-26 00:11:15,816 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2021-03-26 00:11:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2021-03-26 00:11:15,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:15,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2021-03-26 00:11:15,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:15,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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:15,826 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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:15,826 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 88 flow. Second operand 6 states and 903 transitions. [2021-03-26 00:11:15,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 184 flow [2021-03-26 00:11:15,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:15,830 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 138 flow [2021-03-26 00:11:15,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2021-03-26 00:11:15,830 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 00:11:15,830 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:15,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 138 flow [2021-03-26 00:11:15,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 138 flow [2021-03-26 00:11:15,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 138 flow [2021-03-26 00:11:15,840 INFO L129 PetriNetUnfolder]: 11/45 cut-off events. [2021-03-26 00:11:15,840 INFO L130 PetriNetUnfolder]: For 58/64 co-relation queries the response was YES. [2021-03-26 00:11:15,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 45 events. 11/45 cut-off events. For 58/64 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 2 based on Foata normal form. 3/47 useless extension candidates. Maximal degree in co-relation 138. Up to 23 conditions per place. [2021-03-26 00:11:15,841 INFO L142 LiptonReduction]: Number of co-enabled transitions 228 [2021-03-26 00:11:15,957 INFO L154 LiptonReduction]: Checked pairs total: 229 [2021-03-26 00:11:15,957 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:15,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 00:11:15,958 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 138 flow [2021-03-26 00:11:15,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:15,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:15,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:15,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:11:15,959 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1402221011, now seen corresponding path program 1 times [2021-03-26 00:11:15,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:15,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965629208] [2021-03-26 00:11:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:16,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:16,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:16,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:16,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:16,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:16,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:16,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:16,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:16,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:16,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:16,085 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:16,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965629208] [2021-03-26 00:11:16,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:16,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:11:16,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28730062] [2021-03-26 00:11:16,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:11:16,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:16,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:11:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:11:16,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-26 00:11:16,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 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:16,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:16,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-26 00:11:16,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:16,143 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-26 00:11:16,144 INFO L130 PetriNetUnfolder]: For 73/91 co-relation queries the response was YES. [2021-03-26 00:11:16,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 36 events. 7/36 cut-off events. For 73/91 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 14/49 useless extension candidates. Maximal degree in co-relation 125. Up to 20 conditions per place. [2021-03-26 00:11:16,144 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 2 selfloop transitions, 10 changer transitions 4/31 dead transitions. [2021-03-26 00:11:16,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 206 flow [2021-03-26 00:11:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:11:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:11:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1047 transitions. [2021-03-26 00:11:16,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8546938775510204 [2021-03-26 00:11:16,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1047 transitions. [2021-03-26 00:11:16,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1047 transitions. [2021-03-26 00:11:16,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:16,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1047 transitions. [2021-03-26 00:11:16,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.57142857142858) internal successors, (1047), 7 states have internal predecessors, (1047), 0 states have call successors, (0), 0 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:16,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:16,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:16,154 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 138 flow. Second operand 7 states and 1047 transitions. [2021-03-26 00:11:16,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 206 flow [2021-03-26 00:11:16,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 166 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-26 00:11:16,157 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 136 flow [2021-03-26 00:11:16,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2021-03-26 00:11:16,158 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-26 00:11:16,158 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:16,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 136 flow [2021-03-26 00:11:16,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 136 flow [2021-03-26 00:11:16,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 136 flow [2021-03-26 00:11:16,166 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-26 00:11:16,167 INFO L130 PetriNetUnfolder]: For 33/36 co-relation queries the response was YES. [2021-03-26 00:11:16,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 30 events. 5/30 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2021-03-26 00:11:16,167 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 00:11:16,479 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:11:16,628 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:11:16,794 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:17,034 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:11:17,187 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:11:17,191 INFO L154 LiptonReduction]: Checked pairs total: 630 [2021-03-26 00:11:17,192 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:11:17,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1034 [2021-03-26 00:11:17,192 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 132 flow [2021-03-26 00:11:17,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 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:17,193 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:17,193 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:17,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:11:17,193 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -185469823, now seen corresponding path program 1 times [2021-03-26 00:11:17,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:17,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499146220] [2021-03-26 00:11:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:17,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:17,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:17,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:17,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:17,278 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:11:17,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:11:17,288 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:17,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499146220] [2021-03-26 00:11:17,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:17,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:17,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034371022] [2021-03-26 00:11:17,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:17,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:17,291 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2021-03-26 00:11:17,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:17,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:17,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2021-03-26 00:11:17,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:17,350 INFO L129 PetriNetUnfolder]: 28/95 cut-off events. [2021-03-26 00:11:17,350 INFO L130 PetriNetUnfolder]: For 153/182 co-relation queries the response was YES. [2021-03-26 00:11:17,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 95 events. 28/95 cut-off events. For 153/182 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 347 event pairs, 0 based on Foata normal form. 16/109 useless extension candidates. Maximal degree in co-relation 248. Up to 28 conditions per place. [2021-03-26 00:11:17,351 INFO L132 encePairwiseOnDemand]: 172/177 looper letters, 5 selfloop transitions, 5 changer transitions 4/32 dead transitions. [2021-03-26 00:11:17,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 174 flow [2021-03-26 00:11:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:11:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:11:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2021-03-26 00:11:17,354 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8234463276836158 [2021-03-26 00:11:17,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2021-03-26 00:11:17,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2021-03-26 00:11:17,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:17,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2021-03-26 00:11:17,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 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:17,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:17,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:17,358 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 132 flow. Second operand 4 states and 583 transitions. [2021-03-26 00:11:17,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 174 flow [2021-03-26 00:11:17,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 136 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-26 00:11:17,362 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 118 flow [2021-03-26 00:11:17,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-26 00:11:17,362 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-26 00:11:17,362 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:17,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 118 flow [2021-03-26 00:11:17,363 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 118 flow [2021-03-26 00:11:17,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 118 flow [2021-03-26 00:11:17,368 INFO L129 PetriNetUnfolder]: 6/31 cut-off events. [2021-03-26 00:11:17,368 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2021-03-26 00:11:17,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 31 events. 6/31 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 68. Up to 8 conditions per place. [2021-03-26 00:11:17,369 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-26 00:11:17,582 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-26 00:11:17,582 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:11:17,582 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 220 [2021-03-26 00:11:17,583 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 114 flow [2021-03-26 00:11:17,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:17,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:17,584 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:17,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:11:17,584 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash -633052145, now seen corresponding path program 1 times [2021-03-26 00:11:17,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:17,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574745363] [2021-03-26 00:11:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:17,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:17,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:17,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:17,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:17,637 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:11:17,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:11:17,646 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:17,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574745363] [2021-03-26 00:11:17,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:17,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:17,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755914323] [2021-03-26 00:11:17,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:17,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:17,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 179 [2021-03-26 00:11:17,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:17,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:17,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 179 [2021-03-26 00:11:17,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:17,691 INFO L129 PetriNetUnfolder]: 15/57 cut-off events. [2021-03-26 00:11:17,691 INFO L130 PetriNetUnfolder]: For 63/76 co-relation queries the response was YES. [2021-03-26 00:11:17,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 57 events. 15/57 cut-off events. For 63/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 164 event pairs, 0 based on Foata normal form. 12/68 useless extension candidates. Maximal degree in co-relation 150. Up to 18 conditions per place. [2021-03-26 00:11:17,692 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 5 changer transitions 3/30 dead transitions. [2021-03-26 00:11:17,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 162 flow [2021-03-26 00:11:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-03-26 00:11:17,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7910614525139665 [2021-03-26 00:11:17,696 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-03-26 00:11:17,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-03-26 00:11:17,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:17,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-03-26 00:11:17,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 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:17,699 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:17,699 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:17,699 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 114 flow. Second operand 5 states and 708 transitions. [2021-03-26 00:11:17,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 162 flow [2021-03-26 00:11:17,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:11:17,702 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 140 flow [2021-03-26 00:11:17,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-03-26 00:11:17,703 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-26 00:11:17,703 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:17,703 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 140 flow [2021-03-26 00:11:17,703 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 140 flow [2021-03-26 00:11:17,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 26 transitions, 140 flow [2021-03-26 00:11:17,711 INFO L129 PetriNetUnfolder]: 8/37 cut-off events. [2021-03-26 00:11:17,711 INFO L130 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES. [2021-03-26 00:11:17,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 37 events. 8/37 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 3/39 useless extension candidates. Maximal degree in co-relation 98. Up to 12 conditions per place. [2021-03-26 00:11:17,712 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-26 00:11:17,988 INFO L154 LiptonReduction]: Checked pairs total: 122 [2021-03-26 00:11:17,988 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:17,989 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 286 [2021-03-26 00:11:17,989 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 138 flow [2021-03-26 00:11:17,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:17,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:17,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:17,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:11:17,990 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1752164642, now seen corresponding path program 1 times [2021-03-26 00:11:17,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:17,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247942078] [2021-03-26 00:11:17,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:18,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:18,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:18,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:18,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:18,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:18,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:18,042 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:18,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247942078] [2021-03-26 00:11:18,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:18,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:18,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683084535] [2021-03-26 00:11:18,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:18,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:18,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 180 [2021-03-26 00:11:18,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:18,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:18,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 180 [2021-03-26 00:11:18,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:18,066 INFO L129 PetriNetUnfolder]: 11/44 cut-off events. [2021-03-26 00:11:18,067 INFO L130 PetriNetUnfolder]: For 76/83 co-relation queries the response was YES. [2021-03-26 00:11:18,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 44 events. 11/44 cut-off events. For 76/83 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 8/52 useless extension candidates. Maximal degree in co-relation 123. Up to 16 conditions per place. [2021-03-26 00:11:18,067 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 3 selfloop transitions, 1 changer transitions 3/25 dead transitions. [2021-03-26 00:11:18,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 25 transitions, 150 flow [2021-03-26 00:11:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:11:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:11:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-03-26 00:11:18,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2021-03-26 00:11:18,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-03-26 00:11:18,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-03-26 00:11:18,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:18,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-03-26 00:11:18,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 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:18,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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:18,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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:18,074 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 138 flow. Second operand 4 states and 606 transitions. [2021-03-26 00:11:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 25 transitions, 150 flow [2021-03-26 00:11:18,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 25 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:18,076 INFO L241 Difference]: Finished difference. Result has 43 places, 22 transitions, 115 flow [2021-03-26 00:11:18,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2021-03-26 00:11:18,076 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-03-26 00:11:18,076 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:18,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 22 transitions, 115 flow [2021-03-26 00:11:18,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 22 transitions, 115 flow [2021-03-26 00:11:18,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 22 transitions, 115 flow [2021-03-26 00:11:18,080 INFO L129 PetriNetUnfolder]: 5/25 cut-off events. [2021-03-26 00:11:18,080 INFO L130 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2021-03-26 00:11:18,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 25 events. 5/25 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 2/26 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2021-03-26 00:11:18,081 INFO L142 LiptonReduction]: Number of co-enabled transitions 58 [2021-03-26 00:11:19,013 WARN L205 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-26 00:11:19,314 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 00:11:20,733 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:11:21,366 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:11:21,429 INFO L154 LiptonReduction]: Checked pairs total: 120 [2021-03-26 00:11:21,430 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:21,430 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3354 [2021-03-26 00:11:21,431 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 113 flow [2021-03-26 00:11:21,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 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:21,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:21,431 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:21,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:11:21,431 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 208930056, now seen corresponding path program 1 times [2021-03-26 00:11:21,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:21,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462460242] [2021-03-26 00:11:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:21,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:21,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:21,534 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-26 00:11:21,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:11:21,549 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-26 00:11:21,551 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-26 00:11:21,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:21,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:21,580 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:21,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462460242] [2021-03-26 00:11:21,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:21,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:11:21,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575637364] [2021-03-26 00:11:21,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:11:21,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:21,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:11:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:11:21,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 181 [2021-03-26 00:11:21,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:21,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:21,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 181 [2021-03-26 00:11:21,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:21,649 INFO L129 PetriNetUnfolder]: 16/53 cut-off events. [2021-03-26 00:11:21,649 INFO L130 PetriNetUnfolder]: For 132/142 co-relation queries the response was YES. [2021-03-26 00:11:21,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 53 events. 16/53 cut-off events. For 132/142 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 149 event pairs, 0 based on Foata normal form. 9/60 useless extension candidates. Maximal degree in co-relation 153. Up to 18 conditions per place. [2021-03-26 00:11:21,650 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 5 selfloop transitions, 5 changer transitions 2/27 dead transitions. [2021-03-26 00:11:21,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 27 transitions, 167 flow [2021-03-26 00:11:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:11:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:11:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2021-03-26 00:11:21,653 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7633517495395948 [2021-03-26 00:11:21,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2021-03-26 00:11:21,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2021-03-26 00:11:21,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:21,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2021-03-26 00:11:21,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 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:21,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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:21,659 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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:21,659 INFO L185 Difference]: Start difference. First operand has 40 places, 21 transitions, 113 flow. Second operand 6 states and 829 transitions. [2021-03-26 00:11:21,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 27 transitions, 167 flow [2021-03-26 00:11:21,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 141 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-03-26 00:11:21,661 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 136 flow [2021-03-26 00:11:21,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-26 00:11:21,661 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-26 00:11:21,661 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:21,661 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 136 flow [2021-03-26 00:11:21,661 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 25 transitions, 136 flow [2021-03-26 00:11:21,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 136 flow [2021-03-26 00:11:21,666 INFO L129 PetriNetUnfolder]: 13/43 cut-off events. [2021-03-26 00:11:21,667 INFO L130 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2021-03-26 00:11:21,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 43 events. 13/43 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 98 event pairs, 0 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 120. Up to 14 conditions per place. [2021-03-26 00:11:21,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-26 00:11:21,882 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-03-26 00:11:22,361 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2021-03-26 00:11:22,518 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:22,660 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2021-03-26 00:11:22,938 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 84 [2021-03-26 00:11:22,995 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 00:11:22,995 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:11:22,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1335 [2021-03-26 00:11:22,996 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 142 flow [2021-03-26 00:11:22,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:22,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:22,997 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:22,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:11:22,997 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1998653840, now seen corresponding path program 1 times [2021-03-26 00:11:22,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:22,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028339115] [2021-03-26 00:11:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:23,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:23,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:11:23,078 INFO L142 QuantifierPusher]: treesize reduction 12, result has 69.2 percent of original size [2021-03-26 00:11:23,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 00:11:23,101 INFO L142 QuantifierPusher]: treesize reduction 23, result has 80.3 percent of original size [2021-03-26 00:11:23,103 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.4 percent of original size 85 [2021-03-26 00:11:23,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:23,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:11:23,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:23,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:11:23,162 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:23,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028339115] [2021-03-26 00:11:23,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:23,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:11:23,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194800868] [2021-03-26 00:11:23,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:11:23,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:11:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:11:23,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 183 [2021-03-26 00:11:23,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 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:23,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:23,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 183 [2021-03-26 00:11:23,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:23,281 INFO L129 PetriNetUnfolder]: 18/62 cut-off events. [2021-03-26 00:11:23,281 INFO L130 PetriNetUnfolder]: For 143/158 co-relation queries the response was YES. [2021-03-26 00:11:23,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 62 events. 18/62 cut-off events. For 143/158 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 191 event pairs, 1 based on Foata normal form. 11/70 useless extension candidates. Maximal degree in co-relation 196. Up to 23 conditions per place. [2021-03-26 00:11:23,282 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 6 selfloop transitions, 5 changer transitions 3/29 dead transitions. [2021-03-26 00:11:23,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 201 flow [2021-03-26 00:11:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:11:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:11:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2021-03-26 00:11:23,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7122040072859745 [2021-03-26 00:11:23,285 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 782 transitions. [2021-03-26 00:11:23,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 782 transitions. [2021-03-26 00:11:23,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:23,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 782 transitions. [2021-03-26 00:11:23,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 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:23,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:23,290 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:23,290 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 142 flow. Second operand 6 states and 782 transitions. [2021-03-26 00:11:23,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 201 flow [2021-03-26 00:11:23,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 29 transitions, 191 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:23,293 INFO L241 Difference]: Finished difference. Result has 46 places, 25 transitions, 155 flow [2021-03-26 00:11:23,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=25} [2021-03-26 00:11:23,294 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-26 00:11:23,294 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:23,295 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 25 transitions, 155 flow [2021-03-26 00:11:23,295 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 25 transitions, 155 flow [2021-03-26 00:11:23,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 25 transitions, 155 flow [2021-03-26 00:11:23,307 INFO L129 PetriNetUnfolder]: 13/46 cut-off events. [2021-03-26 00:11:23,307 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-03-26 00:11:23,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 46 events. 13/46 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 114 event pairs, 1 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 143. Up to 17 conditions per place. [2021-03-26 00:11:23,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 32 [2021-03-26 00:11:23,309 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:11:23,309 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:23,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:11:23,312 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 155 flow [2021-03-26 00:11:23,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 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:23,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:23,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:23,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:11:23,313 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1749611385, now seen corresponding path program 1 times [2021-03-26 00:11:23,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:23,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237546325] [2021-03-26 00:11:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:11:23,351 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:11:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:11:23,394 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:11:23,429 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:11:23,430 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:11:23,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:11:23,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:11:23 BasicIcfg [2021-03-26 00:11:23,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:11:23,502 INFO L168 Benchmark]: Toolchain (without parser) took 17145.16 ms. Allocated memory was 255.9 MB in the beginning and 641.7 MB in the end (delta: 385.9 MB). Free memory was 233.9 MB in the beginning and 365.2 MB in the end (delta: -131.3 MB). Peak memory consumption was 253.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,503 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:11:23,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.08 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.9 MB in the beginning and 328.1 MB in the end (delta: -94.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 369.1 MB. Free memory was 328.1 MB in the beginning and 325.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,503 INFO L168 Benchmark]: Boogie Preprocessor took 51.80 ms. Allocated memory is still 369.1 MB. Free memory was 325.5 MB in the beginning and 323.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,503 INFO L168 Benchmark]: RCFGBuilder took 1774.63 ms. Allocated memory is still 369.1 MB. Free memory was 323.4 MB in the beginning and 337.0 MB in the end (delta: -13.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,504 INFO L168 Benchmark]: TraceAbstraction took 14571.39 ms. Allocated memory was 369.1 MB in the beginning and 641.7 MB in the end (delta: 272.6 MB). Free memory was 337.0 MB in the beginning and 365.2 MB in the end (delta: -28.3 MB). Peak memory consumption was 244.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:11:23,505 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.70 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 670.08 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.9 MB in the beginning and 328.1 MB in the end (delta: -94.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 369.1 MB. Free memory was 328.1 MB in the beginning and 325.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.80 ms. Allocated memory is still 369.1 MB. Free memory was 325.5 MB in the beginning and 323.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1774.63 ms. Allocated memory is still 369.1 MB. Free memory was 323.4 MB in the beginning and 337.0 MB in the end (delta: -13.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14571.39 ms. Allocated memory was 369.1 MB in the beginning and 641.7 MB in the end (delta: 272.6 MB). Free memory was 337.0 MB in the beginning and 365.2 MB in the end (delta: -28.3 MB). Peak memory consumption was 244.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3162.2ms, 104 PlacesBefore, 48 PlacesAfterwards, 96 TransitionsBefore, 39 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 2604 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1544, positive: 1482, positive conditional: 1482, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1208, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1208, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1208, positive: 1169, positive conditional: 0, positive unconditional: 1169, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 426, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 406, negative conditional: 0, negative unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1544, positive: 307, positive conditional: 307, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 1208, unknown conditional: 1208, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 992.8ms, 45 PlacesBefore, 35 PlacesAfterwards, 36 TransitionsBefore, 26 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 316, positive: 252, positive conditional: 252, positive unconditional: 0, negative: 64, negative conditional: 64, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, positive: 97, positive conditional: 5, positive unconditional: 92, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, positive: 97, positive conditional: 5, positive unconditional: 92, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 64, negative conditional: 18, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 316, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 98, Positive conditional cache size: 98, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1327.2ms, 38 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 17, negative conditional: 2, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 121, positive conditional: 121, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 106, Positive conditional cache size: 106, 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: 105.0ms, 36 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 217 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 57, positive conditional: 57, 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: 37, positive: 33, positive conditional: 7, positive unconditional: 26, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 33, positive conditional: 7, positive unconditional: 26, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 139, Positive conditional cache size: 139, 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: 126.6ms, 40 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1033.4ms, 42 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 630 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 324, positive: 270, positive conditional: 270, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 30, positive unconditional: 6, 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: 38, positive: 36, positive conditional: 30, positive unconditional: 6, 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: 38, positive: 36, positive conditional: 0, positive unconditional: 36, 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: 83, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, positive: 234, positive conditional: 234, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.2ms, 37 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 67, positive conditional: 67, 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: 31, positive: 25, positive conditional: 20, positive unconditional: 5, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 20, positive unconditional: 5, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 160, negative conditional: 37, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 285.2ms, 42 PlacesBefore, 41 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3353.2ms, 43 PlacesBefore, 40 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 8, positive unconditional: 2, 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: 12, positive: 10, positive conditional: 8, positive unconditional: 2, 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: 12, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 59, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 43, Positive conditional cache size: 43, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1334.2ms, 42 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.0ms, 46 PlacesBefore, 44 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t672; [L835] FCALL, FORK 0 pthread_create(&t672, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] 0 pthread_t t673; [L837] FCALL, FORK 0 pthread_create(&t673, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t674; [L839] FCALL, FORK 0 pthread_create(&t674, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 [L806] 3 __unbuffered_p2_EAX = y [L809] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L746] 1 z = 1 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$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=51, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 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=51, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14351.1ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 773.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3264.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 19 SDslu, 20 SDs, 0 SdLazy, 211 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 236.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 241.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=10, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.0ms SsaConstructionTime, 442.5ms SatisfiabilityAnalysisTime, 727.2ms InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...