/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:10:21,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:10:21,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:10:21,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:10:21,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:10:21,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:10:21,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:10:21,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:10:21,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:10:21,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:10:21,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:10:21,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:10:21,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:10:21,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:10:21,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:10:21,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:10:21,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:10:21,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:10:21,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:10:21,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:10:21,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:10:21,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:10:21,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:10:21,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:10:21,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:10:21,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:10:21,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:10:21,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:10:21,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:10:21,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:10:21,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:10:21,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:10:21,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:10:21,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:10:21,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:10:21,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:10:21,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:10:21,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:10:21,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:10:21,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:10:21,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:10:21,957 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-RepeatedSemanticLbe.epf [2021-03-25 14:10:21,978 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:10:21,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:10:21,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:10:21,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:10:21,980 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:10:21,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:10:21,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:10:21,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:10:21,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:10:21,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:10:21,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:10:21,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:10:21,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:10:21,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:10:21,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:10:21,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:10:21,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:10:21,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:10:21,984 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:10:22,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:10:22,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:10:22,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:10:22,295 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:10:22,295 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:10:22,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2021-03-25 14:10:22,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e33265e2/5a17210a3242421d802dea4028f2e9bd/FLAGec0a229a8 [2021-03-25 14:10:22,912 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:10:22,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2021-03-25 14:10:22,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e33265e2/5a17210a3242421d802dea4028f2e9bd/FLAGec0a229a8 [2021-03-25 14:10:23,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e33265e2/5a17210a3242421d802dea4028f2e9bd [2021-03-25 14:10:23,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:10:23,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:10:23,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:10:23,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:10:23,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:10:23,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6d1ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23, skipping insertion in model container [2021-03-25 14:10:23,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:10:23,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:10:23,573 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/mix003_power.oepc.i[951,964] [2021-03-25 14:10:23,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:10:23,709 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:10:23,718 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/mix003_power.oepc.i[951,964] [2021-03-25 14:10:23,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:10:23,832 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:10:23,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23 WrapperNode [2021-03-25 14:10:23,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:10:23,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:10:23,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:10:23,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:10:23,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:10:23,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:10:23,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:10:23,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:10:23,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... [2021-03-25 14:10:23,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:10:23,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:10:23,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:10:23,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:10:23,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:10:24,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:10:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:10:24,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:10:24,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:10:24,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:10:24,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:10:24,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:10:24,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:10:24,030 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:10:24,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:10:24,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:10:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:10:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:10:24,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:10:24,032 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:10:25,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:10:25,697 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:10:25,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:10:25 BoogieIcfgContainer [2021-03-25 14:10:25,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:10:25,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:10:25,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:10:25,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:10:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:10:23" (1/3) ... [2021-03-25 14:10:25,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d663f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:10:25, skipping insertion in model container [2021-03-25 14:10:25,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:10:23" (2/3) ... [2021-03-25 14:10:25,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d663f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:10:25, skipping insertion in model container [2021-03-25 14:10:25,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:10:25" (3/3) ... [2021-03-25 14:10:25,708 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2021-03-25 14:10:25,713 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:10:25,717 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:10:25,717 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:10:25,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:10:25,780 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:10:25,796 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:10:25,813 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:10:25,813 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:10:25,813 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:10:25,813 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:10:25,813 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:10:25,813 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:10:25,813 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:10:25,813 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:10:25,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-03-25 14:10:25,853 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-25 14:10:25,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:25,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 14:10:25,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-03-25 14:10:25,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-03-25 14:10:25,862 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:25,873 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-25 14:10:25,875 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-25 14:10:25,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-03-25 14:10:25,892 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-25 14:10:25,893 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:25,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 14:10:25,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 1872 [2021-03-25 14:10:27,220 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:10:27,661 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-25 14:10:27,809 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:10:29,017 INFO L154 LiptonReduction]: Checked pairs total: 3765 [2021-03-25 14:10:29,017 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 14:10:29,019 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3158 [2021-03-25 14:10:29,027 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:10:29,027 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:29,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:29,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:29,028 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash -754458165, now seen corresponding path program 1 times [2021-03-25 14:10:29,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:29,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303530381] [2021-03-25 14:10:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:29,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:29,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:29,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:29,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:29,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303530381] [2021-03-25 14:10:29,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:29,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:10:29,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205241216] [2021-03-25 14:10:29,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:10:29,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:10:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:10:29,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 171 [2021-03-25 14:10:29,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:29,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:29,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 171 [2021-03-25 14:10:29,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:29,381 INFO L129 PetriNetUnfolder]: 49/161 cut-off events. [2021-03-25 14:10:29,382 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:29,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 161 events. 49/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 705 event pairs, 38 based on Foata normal form. 17/169 useless extension candidates. Maximal degree in co-relation 236. Up to 65 conditions per place. [2021-03-25 14:10:29,385 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 9 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-25 14:10:29,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 117 flow [2021-03-25 14:10:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:10:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:10:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-25 14:10:29,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.898635477582846 [2021-03-25 14:10:29,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-25 14:10:29,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-25 14:10:29,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:29,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-25 14:10:29,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:29,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:29,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:29,429 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 3 states and 461 transitions. [2021-03-25 14:10:29,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 117 flow [2021-03-25 14:10:29,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:10:29,434 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2021-03-25 14:10:29,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2021-03-25 14:10:29,436 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 14:10:29,436 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:29,437 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 14:10:29,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 14:10:29,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 88 flow [2021-03-25 14:10:29,447 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-25 14:10:29,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:29,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:10:29,447 INFO L142 LiptonReduction]: Number of co-enabled transitions 406 [2021-03-25 14:10:30,719 INFO L154 LiptonReduction]: Checked pairs total: 1840 [2021-03-25 14:10:30,719 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:10:30,720 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1284 [2021-03-25 14:10:30,721 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-25 14:10:30,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:30,721 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:30,721 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:30,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:10:30,722 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash 382290365, now seen corresponding path program 1 times [2021-03-25 14:10:30,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:30,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862977855] [2021-03-25 14:10:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:30,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:30,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:30,805 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:10:30,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:10:30,817 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:10:30,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:10:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:30,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862977855] [2021-03-25 14:10:30,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:30,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:10:30,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951579600] [2021-03-25 14:10:30,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:30,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:30,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2021-03-25 14:10:30,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:30,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:30,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2021-03-25 14:10:30,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:30,895 INFO L129 PetriNetUnfolder]: 92/227 cut-off events. [2021-03-25 14:10:30,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:10:30,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 227 events. 92/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1126 event pairs, 26 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 389. Up to 81 conditions per place. [2021-03-25 14:10:30,897 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 6 selfloop transitions, 4 changer transitions 12/41 dead transitions. [2021-03-25 14:10:30,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 136 flow [2021-03-25 14:10:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:10:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:10:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2021-03-25 14:10:30,900 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8174863387978142 [2021-03-25 14:10:30,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 748 transitions. [2021-03-25 14:10:30,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 748 transitions. [2021-03-25 14:10:30,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:30,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 748 transitions. [2021-03-25 14:10:30,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:30,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:30,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:30,905 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 5 states and 748 transitions. [2021-03-25 14:10:30,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 136 flow [2021-03-25 14:10:30,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:10:30,906 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 94 flow [2021-03-25 14:10:30,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-25 14:10:30,907 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2021-03-25 14:10:30,907 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:30,907 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 94 flow [2021-03-25 14:10:30,908 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 94 flow [2021-03-25 14:10:30,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 94 flow [2021-03-25 14:10:30,918 INFO L129 PetriNetUnfolder]: 35/115 cut-off events. [2021-03-25 14:10:30,919 INFO L130 PetriNetUnfolder]: For 32/33 co-relation queries the response was YES. [2021-03-25 14:10:30,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 115 events. 35/115 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 474 event pairs, 20 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 224. Up to 56 conditions per place. [2021-03-25 14:10:30,920 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-25 14:10:31,033 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-03-25 14:10:31,574 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:10:31,708 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:10:32,020 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:10:32,175 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:10:32,179 INFO L154 LiptonReduction]: Checked pairs total: 579 [2021-03-25 14:10:32,179 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:10:32,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1272 [2021-03-25 14:10:32,180 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 90 flow [2021-03-25 14:10:32,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:32,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:32,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:10:32,181 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1388482237, now seen corresponding path program 1 times [2021-03-25 14:10:32,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:32,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585340778] [2021-03-25 14:10:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:32,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,327 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:10:32,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:10:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:32,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585340778] [2021-03-25 14:10:32,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:32,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:10:32,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936673454] [2021-03-25 14:10:32,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:32,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:32,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 185 [2021-03-25 14:10:32,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:32,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 185 [2021-03-25 14:10:32,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:32,370 INFO L129 PetriNetUnfolder]: 36/111 cut-off events. [2021-03-25 14:10:32,371 INFO L130 PetriNetUnfolder]: For 50/77 co-relation queries the response was YES. [2021-03-25 14:10:32,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 111 events. 36/111 cut-off events. For 50/77 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 454 event pairs, 18 based on Foata normal form. 5/113 useless extension candidates. Maximal degree in co-relation 274. Up to 59 conditions per place. [2021-03-25 14:10:32,372 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 10 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 14:10:32,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 132 flow [2021-03-25 14:10:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:10:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:10:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-25 14:10:32,375 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8306306306306306 [2021-03-25 14:10:32,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:32,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,379 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 90 flow. Second operand 3 states and 461 transitions. [2021-03-25 14:10:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 132 flow [2021-03-25 14:10:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:10:32,380 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 97 flow [2021-03-25 14:10:32,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-25 14:10:32,381 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2021-03-25 14:10:32,381 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:32,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 97 flow [2021-03-25 14:10:32,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 97 flow [2021-03-25 14:10:32,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 97 flow [2021-03-25 14:10:32,393 INFO L129 PetriNetUnfolder]: 26/95 cut-off events. [2021-03-25 14:10:32,393 INFO L130 PetriNetUnfolder]: For 38/45 co-relation queries the response was YES. [2021-03-25 14:10:32,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 95 events. 26/95 cut-off events. For 38/45 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 389 event pairs, 8 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 197. Up to 47 conditions per place. [2021-03-25 14:10:32,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 308 [2021-03-25 14:10:32,397 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-25 14:10:32,397 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:10:32,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 14:10:32,398 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 97 flow [2021-03-25 14:10:32,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,399 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:32,399 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:32,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:10:32,400 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash -10394974, now seen corresponding path program 1 times [2021-03-25 14:10:32,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:32,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765838158] [2021-03-25 14:10:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:32,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,448 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:10:32,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:10:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:32,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765838158] [2021-03-25 14:10:32,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:32,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:10:32,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147767524] [2021-03-25 14:10:32,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:32,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:32,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 185 [2021-03-25 14:10:32,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:32,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 185 [2021-03-25 14:10:32,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:32,494 INFO L129 PetriNetUnfolder]: 28/83 cut-off events. [2021-03-25 14:10:32,494 INFO L130 PetriNetUnfolder]: For 79/113 co-relation queries the response was YES. [2021-03-25 14:10:32,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 83 events. 28/83 cut-off events. For 79/113 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 286 event pairs, 4 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 233. Up to 47 conditions per place. [2021-03-25 14:10:32,495 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 10 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 14:10:32,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 142 flow [2021-03-25 14:10:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:10:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:10:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-25 14:10:32,497 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8306306306306306 [2021-03-25 14:10:32,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:32,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-25 14:10:32,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,502 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 97 flow. Second operand 3 states and 461 transitions. [2021-03-25 14:10:32,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 142 flow [2021-03-25 14:10:32,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:10:32,504 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 102 flow [2021-03-25 14:10:32,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-25 14:10:32,505 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2021-03-25 14:10:32,505 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:32,505 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 102 flow [2021-03-25 14:10:32,506 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 102 flow [2021-03-25 14:10:32,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 102 flow [2021-03-25 14:10:32,518 INFO L129 PetriNetUnfolder]: 19/83 cut-off events. [2021-03-25 14:10:32,519 INFO L130 PetriNetUnfolder]: For 37/42 co-relation queries the response was YES. [2021-03-25 14:10:32,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 83 events. 19/83 cut-off events. For 37/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 321 event pairs, 12 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 172. Up to 36 conditions per place. [2021-03-25 14:10:32,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-25 14:10:32,525 INFO L154 LiptonReduction]: Checked pairs total: 204 [2021-03-25 14:10:32,525 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:10:32,525 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 14:10:32,527 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 102 flow [2021-03-25 14:10:32,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:32,528 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:32,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:10:32,528 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:32,528 INFO L82 PathProgramCache]: Analyzing trace with hash 847693667, now seen corresponding path program 1 times [2021-03-25 14:10:32,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:32,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782208795] [2021-03-25 14:10:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:32,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:32,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782208795] [2021-03-25 14:10:32,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:32,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:10:32,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210139879] [2021-03-25 14:10:32,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:32,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:32,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:32,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-25 14:10:32,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:32,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-25 14:10:32,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:32,678 INFO L129 PetriNetUnfolder]: 101/249 cut-off events. [2021-03-25 14:10:32,678 INFO L130 PetriNetUnfolder]: For 63/68 co-relation queries the response was YES. [2021-03-25 14:10:32,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 249 events. 101/249 cut-off events. For 63/68 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1311 event pairs, 28 based on Foata normal form. 20/223 useless extension candidates. Maximal degree in co-relation 541. Up to 151 conditions per place. [2021-03-25 14:10:32,681 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 10 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-25 14:10:32,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 160 flow [2021-03-25 14:10:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:10:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:10:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2021-03-25 14:10:32,684 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486486486486486 [2021-03-25 14:10:32,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2021-03-25 14:10:32,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2021-03-25 14:10:32,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:32,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2021-03-25 14:10:32,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,689 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,689 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 102 flow. Second operand 5 states and 785 transitions. [2021-03-25 14:10:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 160 flow [2021-03-25 14:10:32,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:10:32,692 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 156 flow [2021-03-25 14:10:32,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-25 14:10:32,692 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2021-03-25 14:10:32,693 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:32,693 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 156 flow [2021-03-25 14:10:32,693 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 156 flow [2021-03-25 14:10:32,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 156 flow [2021-03-25 14:10:32,721 INFO L129 PetriNetUnfolder]: 67/195 cut-off events. [2021-03-25 14:10:32,721 INFO L130 PetriNetUnfolder]: For 151/209 co-relation queries the response was YES. [2021-03-25 14:10:32,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 195 events. 67/195 cut-off events. For 151/209 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1097 event pairs, 32 based on Foata normal form. 5/182 useless extension candidates. Maximal degree in co-relation 536. Up to 93 conditions per place. [2021-03-25 14:10:32,724 INFO L142 LiptonReduction]: Number of co-enabled transitions 406 [2021-03-25 14:10:32,737 INFO L154 LiptonReduction]: Checked pairs total: 519 [2021-03-25 14:10:32,737 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:10:32,737 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 14:10:32,739 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 150 flow [2021-03-25 14:10:32,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:32,739 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:32,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:10:32,740 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1074627342, now seen corresponding path program 1 times [2021-03-25 14:10:32,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:32,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728765578] [2021-03-25 14:10:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:32,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:32,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:32,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:32,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728765578] [2021-03-25 14:10:32,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:32,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:10:32,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377301174] [2021-03-25 14:10:32,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:32,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:32,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 185 [2021-03-25 14:10:32,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:32,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 185 [2021-03-25 14:10:32,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:32,882 INFO L129 PetriNetUnfolder]: 100/265 cut-off events. [2021-03-25 14:10:32,883 INFO L130 PetriNetUnfolder]: For 291/349 co-relation queries the response was YES. [2021-03-25 14:10:32,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 265 events. 100/265 cut-off events. For 291/349 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1477 event pairs, 39 based on Foata normal form. 14/258 useless extension candidates. Maximal degree in co-relation 744. Up to 137 conditions per place. [2021-03-25 14:10:32,885 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 5 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2021-03-25 14:10:32,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 159 flow [2021-03-25 14:10:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:10:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:10:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2021-03-25 14:10:32,887 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2021-03-25 14:10:32,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2021-03-25 14:10:32,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2021-03-25 14:10:32,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:32,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2021-03-25 14:10:32,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,891 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,891 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 150 flow. Second operand 4 states and 624 transitions. [2021-03-25 14:10:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 159 flow [2021-03-25 14:10:32,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 153 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:10:32,895 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 141 flow [2021-03-25 14:10:32,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-25 14:10:32,896 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2021-03-25 14:10:32,896 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:32,896 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 141 flow [2021-03-25 14:10:32,896 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 141 flow [2021-03-25 14:10:32,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 141 flow [2021-03-25 14:10:32,924 INFO L129 PetriNetUnfolder]: 94/258 cut-off events. [2021-03-25 14:10:32,924 INFO L130 PetriNetUnfolder]: For 254/286 co-relation queries the response was YES. [2021-03-25 14:10:32,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 258 events. 94/258 cut-off events. For 254/286 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1497 event pairs, 50 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 687. Up to 130 conditions per place. [2021-03-25 14:10:32,927 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-25 14:10:32,966 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-25 14:10:32,967 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:10:32,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 14:10:32,970 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 144 flow [2021-03-25 14:10:32,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:32,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:32,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:32,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:10:32,971 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -340401960, now seen corresponding path program 2 times [2021-03-25 14:10:32,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:32,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670676477] [2021-03-25 14:10:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:33,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:33,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:33,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:33,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:33,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670676477] [2021-03-25 14:10:33,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:33,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:10:33,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645901650] [2021-03-25 14:10:33,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:10:33,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:10:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:10:33,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-25 14:10:33,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:33,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-25 14:10:33,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:33,132 INFO L129 PetriNetUnfolder]: 107/284 cut-off events. [2021-03-25 14:10:33,132 INFO L130 PetriNetUnfolder]: For 238/366 co-relation queries the response was YES. [2021-03-25 14:10:33,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 284 events. 107/284 cut-off events. For 238/366 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1552 event pairs, 13 based on Foata normal form. 51/311 useless extension candidates. Maximal degree in co-relation 888. Up to 162 conditions per place. [2021-03-25 14:10:33,135 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 8 selfloop transitions, 11 changer transitions 3/43 dead transitions. [2021-03-25 14:10:33,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 250 flow [2021-03-25 14:10:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:10:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:10:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 948 transitions. [2021-03-25 14:10:33,137 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494623655913979 [2021-03-25 14:10:33,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 948 transitions. [2021-03-25 14:10:33,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 948 transitions. [2021-03-25 14:10:33,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:33,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 948 transitions. [2021-03-25 14:10:33,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,141 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,141 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 144 flow. Second operand 6 states and 948 transitions. [2021-03-25 14:10:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 250 flow [2021-03-25 14:10:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:10:33,145 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 230 flow [2021-03-25 14:10:33,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-25 14:10:33,145 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2021-03-25 14:10:33,145 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:33,145 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 230 flow [2021-03-25 14:10:33,145 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 230 flow [2021-03-25 14:10:33,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 230 flow [2021-03-25 14:10:33,165 INFO L129 PetriNetUnfolder]: 56/191 cut-off events. [2021-03-25 14:10:33,166 INFO L130 PetriNetUnfolder]: For 376/452 co-relation queries the response was YES. [2021-03-25 14:10:33,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 191 events. 56/191 cut-off events. For 376/452 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1029 event pairs, 18 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 671. Up to 102 conditions per place. [2021-03-25 14:10:33,168 INFO L142 LiptonReduction]: Number of co-enabled transitions 412 [2021-03-25 14:10:33,183 INFO L154 LiptonReduction]: Checked pairs total: 342 [2021-03-25 14:10:33,184 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:10:33,184 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 14:10:33,184 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 222 flow [2021-03-25 14:10:33,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,185 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:33,185 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:33,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:10:33,185 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1315620678, now seen corresponding path program 1 times [2021-03-25 14:10:33,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:33,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084639197] [2021-03-25 14:10:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:33,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:33,300 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 14:10:33,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:10:33,320 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 14:10:33,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:10:33,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:33,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:33,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084639197] [2021-03-25 14:10:33,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:33,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:10:33,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908854524] [2021-03-25 14:10:33,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:10:33,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:10:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:10:33,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 186 [2021-03-25 14:10:33,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:33,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 186 [2021-03-25 14:10:33,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:33,525 INFO L129 PetriNetUnfolder]: 218/591 cut-off events. [2021-03-25 14:10:33,525 INFO L130 PetriNetUnfolder]: For 1079/1137 co-relation queries the response was YES. [2021-03-25 14:10:33,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 591 events. 218/591 cut-off events. For 1079/1137 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3825 event pairs, 48 based on Foata normal form. 6/581 useless extension candidates. Maximal degree in co-relation 1994. Up to 249 conditions per place. [2021-03-25 14:10:33,529 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 9 selfloop transitions, 11 changer transitions 5/51 dead transitions. [2021-03-25 14:10:33,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 320 flow [2021-03-25 14:10:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:10:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:10:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 854 transitions. [2021-03-25 14:10:33,532 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7652329749103942 [2021-03-25 14:10:33,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 854 transitions. [2021-03-25 14:10:33,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 854 transitions. [2021-03-25 14:10:33,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:33,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 854 transitions. [2021-03-25 14:10:33,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:33,536 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 222 flow. Second operand 6 states and 854 transitions. [2021-03-25 14:10:33,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 320 flow [2021-03-25 14:10:33,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 284 flow, removed 16 selfloop flow, removed 3 redundant places. [2021-03-25 14:10:33,546 INFO L241 Difference]: Finished difference. Result has 53 places, 44 transitions, 241 flow [2021-03-25 14:10:33,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2021-03-25 14:10:33,546 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2021-03-25 14:10:33,546 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:33,547 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 241 flow [2021-03-25 14:10:33,547 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 241 flow [2021-03-25 14:10:33,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 241 flow [2021-03-25 14:10:33,594 INFO L129 PetriNetUnfolder]: 192/496 cut-off events. [2021-03-25 14:10:33,594 INFO L130 PetriNetUnfolder]: For 525/545 co-relation queries the response was YES. [2021-03-25 14:10:33,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 496 events. 192/496 cut-off events. For 525/545 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3034 event pairs, 54 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1540. Up to 158 conditions per place. [2021-03-25 14:10:33,641 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:10:34,594 WARN L205 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 14:10:34,951 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:10:37,230 WARN L205 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-25 14:10:38,163 WARN L205 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 309 [2021-03-25 14:10:38,584 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:10:38,730 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:10:38,750 INFO L154 LiptonReduction]: Checked pairs total: 92 [2021-03-25 14:10:38,750 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:10:38,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5204 [2021-03-25 14:10:38,750 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 244 flow [2021-03-25 14:10:38,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:38,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:38,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:38,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:10:38,751 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash -663835330, now seen corresponding path program 2 times [2021-03-25 14:10:38,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:38,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269790119] [2021-03-25 14:10:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:38,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:38,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:38,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:38,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:38,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:38,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:38,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269790119] [2021-03-25 14:10:38,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:38,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:10:38,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531939233] [2021-03-25 14:10:38,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:10:38,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:10:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:10:38,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2021-03-25 14:10:38,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:38,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:38,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2021-03-25 14:10:38,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:38,919 INFO L129 PetriNetUnfolder]: 269/751 cut-off events. [2021-03-25 14:10:38,919 INFO L130 PetriNetUnfolder]: For 987/1031 co-relation queries the response was YES. [2021-03-25 14:10:38,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 751 events. 269/751 cut-off events. For 987/1031 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5259 event pairs, 52 based on Foata normal form. 16/740 useless extension candidates. Maximal degree in co-relation 2361. Up to 241 conditions per place. [2021-03-25 14:10:38,924 INFO L132 encePairwiseOnDemand]: 185/189 looper letters, 7 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2021-03-25 14:10:38,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 284 flow [2021-03-25 14:10:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:10:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:10:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-25 14:10:38,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2021-03-25 14:10:38,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-25 14:10:38,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-25 14:10:38,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:38,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-25 14:10:38,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:38,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:38,931 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:38,931 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 244 flow. Second operand 4 states and 642 transitions. [2021-03-25 14:10:38,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 284 flow [2021-03-25 14:10:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 279 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:10:38,937 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 252 flow [2021-03-25 14:10:38,937 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-25 14:10:38,937 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2021-03-25 14:10:38,937 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:38,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 252 flow [2021-03-25 14:10:38,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 252 flow [2021-03-25 14:10:38,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 252 flow [2021-03-25 14:10:39,004 INFO L129 PetriNetUnfolder]: 239/635 cut-off events. [2021-03-25 14:10:39,004 INFO L130 PetriNetUnfolder]: For 808/840 co-relation queries the response was YES. [2021-03-25 14:10:39,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 635 events. 239/635 cut-off events. For 808/840 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4192 event pairs, 59 based on Foata normal form. 11/615 useless extension candidates. Maximal degree in co-relation 2026. Up to 201 conditions per place. [2021-03-25 14:10:39,011 INFO L142 LiptonReduction]: Number of co-enabled transitions 438 [2021-03-25 14:10:39,055 INFO L154 LiptonReduction]: Checked pairs total: 21 [2021-03-25 14:10:39,055 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:10:39,055 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-25 14:10:39,056 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 255 flow [2021-03-25 14:10:39,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:39,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:39,056 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:39,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:10:39,056 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1238661058, now seen corresponding path program 3 times [2021-03-25 14:10:39,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:39,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459796775] [2021-03-25 14:10:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:39,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:39,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:39,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:39,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:39,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:39,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:39,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:39,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:39,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:39,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:10:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:39,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459796775] [2021-03-25 14:10:39,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:39,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:10:39,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020681502] [2021-03-25 14:10:39,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:10:39,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:39,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:10:39,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:10:39,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 190 [2021-03-25 14:10:39,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:39,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:39,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 190 [2021-03-25 14:10:39,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:39,294 INFO L129 PetriNetUnfolder]: 386/889 cut-off events. [2021-03-25 14:10:39,294 INFO L130 PetriNetUnfolder]: For 1278/1616 co-relation queries the response was YES. [2021-03-25 14:10:39,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3129 conditions, 889 events. 386/889 cut-off events. For 1278/1616 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6346 event pairs, 42 based on Foata normal form. 172/929 useless extension candidates. Maximal degree in co-relation 3105. Up to 279 conditions per place. [2021-03-25 14:10:39,300 INFO L132 encePairwiseOnDemand]: 183/190 looper letters, 5 selfloop transitions, 11 changer transitions 13/49 dead transitions. [2021-03-25 14:10:39,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 324 flow [2021-03-25 14:10:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:10:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:10:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1122 transitions. [2021-03-25 14:10:39,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.843609022556391 [2021-03-25 14:10:39,303 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1122 transitions. [2021-03-25 14:10:39,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1122 transitions. [2021-03-25 14:10:39,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:39,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1122 transitions. [2021-03-25 14:10:39,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.28571428571428) internal successors, (1122), 7 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:39,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:39,308 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:39,309 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 255 flow. Second operand 7 states and 1122 transitions. [2021-03-25 14:10:39,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 324 flow [2021-03-25 14:10:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 298 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-25 14:10:39,313 INFO L241 Difference]: Finished difference. Result has 61 places, 34 transitions, 210 flow [2021-03-25 14:10:39,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2021-03-25 14:10:39,314 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2021-03-25 14:10:39,314 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:39,314 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 34 transitions, 210 flow [2021-03-25 14:10:39,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 34 transitions, 210 flow [2021-03-25 14:10:39,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 34 transitions, 210 flow [2021-03-25 14:10:39,323 INFO L129 PetriNetUnfolder]: 14/74 cut-off events. [2021-03-25 14:10:39,323 INFO L130 PetriNetUnfolder]: For 100/105 co-relation queries the response was YES. [2021-03-25 14:10:39,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 74 events. 14/74 cut-off events. For 100/105 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 3 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 251. Up to 23 conditions per place. [2021-03-25 14:10:39,324 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 14:10:39,553 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-25 14:10:39,836 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-25 14:10:40,181 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:10:40,330 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:10:40,978 WARN L205 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-25 14:10:41,253 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 14:10:42,523 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 296 DAG size of output: 251 [2021-03-25 14:10:43,071 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2021-03-25 14:10:43,213 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 14:10:43,320 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 14:10:43,520 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 14:10:43,694 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 14:10:43,703 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-25 14:10:43,703 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:10:43,703 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4389 [2021-03-25 14:10:43,704 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 197 flow [2021-03-25 14:10:43,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:43,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:43,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:43,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:10:43,704 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 59123917, now seen corresponding path program 1 times [2021-03-25 14:10:43,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:43,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255687445] [2021-03-25 14:10:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:10:43,801 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-25 14:10:43,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:10:43,813 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.8 percent of original size [2021-03-25 14:10:43,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-03-25 14:10:43,877 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-25 14:10:43,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 14:10:43,917 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-25 14:10:43,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-25 14:10:43,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:10:43,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:10:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:10:43,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255687445] [2021-03-25 14:10:43,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:10:43,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:10:43,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989760227] [2021-03-25 14:10:43,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:10:43,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:10:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:10:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:10:43,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 196 [2021-03-25 14:10:43,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:43,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:10:43,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 196 [2021-03-25 14:10:43,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:10:44,231 INFO L129 PetriNetUnfolder]: 21/80 cut-off events. [2021-03-25 14:10:44,231 INFO L130 PetriNetUnfolder]: For 478/509 co-relation queries the response was YES. [2021-03-25 14:10:44,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 80 events. 21/80 cut-off events. For 478/509 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 281 event pairs, 0 based on Foata normal form. 14/88 useless extension candidates. Maximal degree in co-relation 294. Up to 25 conditions per place. [2021-03-25 14:10:44,232 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 7 selfloop transitions, 4 changer transitions 4/33 dead transitions. [2021-03-25 14:10:44,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 33 transitions, 247 flow [2021-03-25 14:10:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:10:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:10:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2021-03-25 14:10:44,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.685374149659864 [2021-03-25 14:10:44,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2021-03-25 14:10:44,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2021-03-25 14:10:44,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:10:44,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2021-03-25 14:10:44,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:44,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:44,239 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:44,239 INFO L185 Difference]: Start difference. First operand has 52 places, 29 transitions, 197 flow. Second operand 6 states and 806 transitions. [2021-03-25 14:10:44,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 33 transitions, 247 flow [2021-03-25 14:10:44,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 188 flow, removed 19 selfloop flow, removed 11 redundant places. [2021-03-25 14:10:44,241 INFO L241 Difference]: Finished difference. Result has 47 places, 27 transitions, 143 flow [2021-03-25 14:10:44,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2021-03-25 14:10:44,242 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2021-03-25 14:10:44,242 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:10:44,242 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 27 transitions, 143 flow [2021-03-25 14:10:44,242 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 27 transitions, 143 flow [2021-03-25 14:10:44,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 27 transitions, 143 flow [2021-03-25 14:10:44,249 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-03-25 14:10:44,249 INFO L130 PetriNetUnfolder]: For 75/79 co-relation queries the response was YES. [2021-03-25 14:10:44,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 50 events. 10/50 cut-off events. For 75/79 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 0 based on Foata normal form. 3/52 useless extension candidates. Maximal degree in co-relation 133. Up to 14 conditions per place. [2021-03-25 14:10:44,250 INFO L142 LiptonReduction]: Number of co-enabled transitions 130 [2021-03-25 14:10:44,952 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2021-03-25 14:10:45,261 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-25 14:10:46,587 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-25 14:10:47,183 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 14:10:47,383 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-03-25 14:10:47,812 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2021-03-25 14:10:47,949 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:10:48,269 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-25 14:10:48,556 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-25 14:10:49,783 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 257 DAG size of output: 256 [2021-03-25 14:10:50,387 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:10:50,411 INFO L154 LiptonReduction]: Checked pairs total: 101 [2021-03-25 14:10:50,411 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:10:50,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6170 [2021-03-25 14:10:50,412 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 149 flow [2021-03-25 14:10:50,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:10:50,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:10:50,413 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:10:50,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:10:50,413 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:10:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:10:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1802053956, now seen corresponding path program 1 times [2021-03-25 14:10:50,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:10:50,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728798099] [2021-03-25 14:10:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:10:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:10:50,454 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:10:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:10:50,496 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:10:50,519 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:10:50,520 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:10:50,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:10:50,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:10:50 BasicIcfg [2021-03-25 14:10:50,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:10:50,587 INFO L168 Benchmark]: Toolchain (without parser) took 27225.51 ms. Allocated memory was 255.9 MB in the beginning and 841.0 MB in the end (delta: 585.1 MB). Free memory was 234.8 MB in the beginning and 544.2 MB in the end (delta: -309.5 MB). Peak memory consumption was 275.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,587 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:10:50,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.36 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.4 MB in the beginning and 309.1 MB in the end (delta: -74.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 350.2 MB. Free memory was 309.1 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,588 INFO L168 Benchmark]: Boogie Preprocessor took 50.76 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,588 INFO L168 Benchmark]: RCFGBuilder took 1741.62 ms. Allocated memory is still 350.2 MB. Free memory was 304.4 MB in the beginning and 292.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,588 INFO L168 Benchmark]: TraceAbstraction took 24884.77 ms. Allocated memory was 350.2 MB in the beginning and 841.0 MB in the end (delta: 490.7 MB). Free memory was 292.9 MB in the beginning and 544.2 MB in the end (delta: -251.3 MB). Peak memory consumption was 240.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:10:50,589 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 472.36 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.4 MB in the beginning and 309.1 MB in the end (delta: -74.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 350.2 MB. Free memory was 309.1 MB in the beginning and 306.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 50.76 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1741.62 ms. Allocated memory is still 350.2 MB. Free memory was 304.4 MB in the beginning and 292.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24884.77 ms. Allocated memory was 350.2 MB in the beginning and 841.0 MB in the end (delta: 490.7 MB). Free memory was 292.9 MB in the beginning and 544.2 MB in the end (delta: -251.3 MB). Peak memory consumption was 240.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3142.1ms, 108 PlacesBefore, 51 PlacesAfterwards, 100 TransitionsBefore, 42 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 3765 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2034, positive: 1933, positive conditional: 0, positive unconditional: 1933, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1267, positive: 1219, positive conditional: 0, positive unconditional: 1219, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, positive: 1219, positive conditional: 0, positive unconditional: 1219, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, positive: 1212, positive conditional: 0, positive unconditional: 1212, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 642, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 604, negative conditional: 0, negative unconditional: 604, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2034, positive: 714, positive conditional: 0, positive unconditional: 714, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1281.8ms, 48 PlacesBefore, 36 PlacesAfterwards, 39 TransitionsBefore, 27 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 583, positive: 474, positive conditional: 0, positive unconditional: 474, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 143, negative conditional: 0, negative unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 583, positive: 422, positive conditional: 0, positive unconditional: 422, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 74, unknown conditional: 0, unknown unconditional: 74] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1271.6ms, 40 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 161, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 14, negative conditional: 0, negative unconditional: 14, 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: 59, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.3ms, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 519 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 106, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 52, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.1ms, 51 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 342 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5203.0ms, 53 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.0ms, 56 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 21 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 21, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4388.8ms, 61 PlacesBefore, 52 PlacesAfterwards, 34 TransitionsBefore, 29 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6169.3ms, 47 PlacesBefore, 44 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 101 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 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: 93, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t62; [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 [L781] 2 __unbuffered_p1_EAX = x [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L804] 3 __unbuffered_p2_EAX = y [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24711.0ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1306.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3210.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 58 SDtfs, 43 SDslu, 33 SDs, 0 SdLazy, 251 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 338.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 408.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.2ms SsaConstructionTime, 428.4ms SatisfiabilityAnalysisTime, 790.3ms InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...