/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:41:48,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:41:48,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:41:48,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:41:48,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:41:48,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:41:48,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:41:48,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:41:48,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:41:48,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:41:48,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:41:48,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:41:48,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:41:48,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:41:48,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:41:48,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:41:48,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:41:48,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:41:48,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:41:48,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:41:48,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:41:48,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:41:48,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:41:48,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:41:48,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:41:48,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:41:48,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:41:48,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:41:48,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:41:48,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:41:48,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:41:48,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:41:48,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:41:48,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:41:48,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:41:48,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:41:48,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:41:48,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:41:48,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:41:48,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:41:48,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:41:48,864 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-RepeatedVariableLbe.epf [2021-03-25 04:41:48,886 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:41:48,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:41:48,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:41:48,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:41:48,888 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:41:48,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:41:48,888 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:41:48,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:41:48,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:41:48,889 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:41:48,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:41:48,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:41:48,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:41:48,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:41:48,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:41:48,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:41:48,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:41:48,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:41:48,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:41:48,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:41:48,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:41:48,891 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:41:48,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:41:48,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:41:48,892 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 04:41:49,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:41:49,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:41:49,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:41:49,245 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:41:49,247 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:41:49,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2021-03-25 04:41:49,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a90ce1c/6059bedd9280418daeb68cef2a3e12d8/FLAGc5845f009 [2021-03-25 04:41:49,871 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:41:49,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2021-03-25 04:41:49,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a90ce1c/6059bedd9280418daeb68cef2a3e12d8/FLAGc5845f009 [2021-03-25 04:41:50,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a90ce1c/6059bedd9280418daeb68cef2a3e12d8 [2021-03-25 04:41:50,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:41:50,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:41:50,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:41:50,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:41:50,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:41:50,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83a7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50, skipping insertion in model container [2021-03-25 04:41:50,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:41:50,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:41:50,505 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/mix033_pso.oepc.i[949,962] [2021-03-25 04:41:50,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:41:50,703 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:41:50,712 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/mix033_pso.oepc.i[949,962] [2021-03-25 04:41:50,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:41:50,829 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:41:50,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50 WrapperNode [2021-03-25 04:41:50,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:41:50,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:41:50,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:41:50,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:41:50,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:41:50,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:41:50,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:41:50,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:41:50,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (1/1) ... [2021-03-25 04:41:50,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:41:50,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:41:50,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:41:50,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:41:50,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (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 04:41:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:41:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:41:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:41:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:41:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:41:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:41:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:41:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:41:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:41:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:41:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:41:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:41:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:41:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:41:50,983 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 04:41:52,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:41:52,538 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:41:52,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:41:52 BoogieIcfgContainer [2021-03-25 04:41:52,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:41:52,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:41:52,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:41:52,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:41:52,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:41:50" (1/3) ... [2021-03-25 04:41:52,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5012b6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:41:52, skipping insertion in model container [2021-03-25 04:41:52,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:50" (2/3) ... [2021-03-25 04:41:52,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5012b6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:41:52, skipping insertion in model container [2021-03-25 04:41:52,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:41:52" (3/3) ... [2021-03-25 04:41:52,547 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_pso.oepc.i [2021-03-25 04:41:52,553 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:41:52,556 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:41:52,557 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:41:52,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,614 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,614 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:52,622 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:41:52,639 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:41:52,656 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:41:52,656 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:41:52,656 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:41:52,656 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:41:52,656 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:41:52,656 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:41:52,657 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:41:52,657 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:41:52,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-03-25 04:41:52,699 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-25 04:41:52,700 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:52,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-25 04:41:52,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-03-25 04:41:52,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-03-25 04:41:52,709 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:52,716 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-25 04:41:52,718 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-25 04:41:52,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2021-03-25 04:41:52,755 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-25 04:41:52,755 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:52,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-25 04:41:52,761 INFO L142 LiptonReduction]: Number of co-enabled transitions 2054 [2021-03-25 04:41:53,859 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:41:54,259 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:41:54,372 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:41:55,112 INFO L154 LiptonReduction]: Checked pairs total: 3138 [2021-03-25 04:41:55,113 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 04:41:55,115 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2407 [2021-03-25 04:41:55,124 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 04:41:55,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:55,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:55,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:55,150 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 04:41:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash 268635314, now seen corresponding path program 1 times [2021-03-25 04:41:55,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:55,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891409956] [2021-03-25 04:41:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:55,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:55,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:55,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:55,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:55,385 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 04:41:55,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891409956] [2021-03-25 04:41:55,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:55,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:55,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126938927] [2021-03-25 04:41:55,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:41:55,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:41:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:41:55,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 174 [2021-03-25 04:41:55,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 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 04:41:55,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:55,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 174 [2021-03-25 04:41:55,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:55,473 INFO L129 PetriNetUnfolder]: 49/197 cut-off events. [2021-03-25 04:41:55,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:55,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 197 events. 49/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 975 event pairs, 38 based on Foata normal form. 17/198 useless extension candidates. Maximal degree in co-relation 271. Up to 65 conditions per place. [2021-03-25 04:41:55,476 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 04:41:55,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 121 flow [2021-03-25 04:41:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:41:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:41:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2021-03-25 04:41:55,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9061302681992337 [2021-03-25 04:41:55,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2021-03-25 04:41:55,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2021-03-25 04:41:55,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:55,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2021-03-25 04:41:55,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:55,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 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 04:41:55,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 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 04:41:55,504 INFO L185 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 473 transitions. [2021-03-25 04:41:55,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 121 flow [2021-03-25 04:41:55,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:41:55,508 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2021-03-25 04:41:55,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2021-03-25 04:41:55,511 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2021-03-25 04:41:55,511 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:55,511 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 04:41:55,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 04:41:55,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-03-25 04:41:55,516 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 04:41:55,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:55,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:41:55,517 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-25 04:41:57,053 INFO L154 LiptonReduction]: Checked pairs total: 2314 [2021-03-25 04:41:57,053 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-25 04:41:57,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1542 [2021-03-25 04:41:57,054 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-25 04:41:57,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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 04:41:57,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:57,055 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 04:41:57,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:41:57,055 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 04:41:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 43347635, now seen corresponding path program 1 times [2021-03-25 04:41:57,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:57,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973187173] [2021-03-25 04:41:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:57,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:57,178 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:57,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:57,192 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:41:57,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:41:57,197 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 04:41:57,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973187173] [2021-03-25 04:41:57,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:57,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:57,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858679076] [2021-03-25 04:41:57,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:57,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:57,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 189 [2021-03-25 04:41:57,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 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 04:41:57,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:57,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 189 [2021-03-25 04:41:57,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:57,317 INFO L129 PetriNetUnfolder]: 148/379 cut-off events. [2021-03-25 04:41:57,317 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:57,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 379 events. 148/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2215 event pairs, 34 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 642. Up to 117 conditions per place. [2021-03-25 04:41:57,323 INFO L132 encePairwiseOnDemand]: 180/189 looper letters, 8 selfloop transitions, 7 changer transitions 14/45 dead transitions. [2021-03-25 04:41:57,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 158 flow [2021-03-25 04:41:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2021-03-25 04:41:57,330 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7883597883597884 [2021-03-25 04:41:57,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2021-03-25 04:41:57,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2021-03-25 04:41:57,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:57,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2021-03-25 04:41:57,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 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 04:41:57,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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 04:41:57,337 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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 04:41:57,337 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 745 transitions. [2021-03-25 04:41:57,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 158 flow [2021-03-25 04:41:57,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:57,343 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 122 flow [2021-03-25 04:41:57,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 04:41:57,344 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2021-03-25 04:41:57,344 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:57,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 122 flow [2021-03-25 04:41:57,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 122 flow [2021-03-25 04:41:57,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 122 flow [2021-03-25 04:41:57,372 INFO L129 PetriNetUnfolder]: 72/239 cut-off events. [2021-03-25 04:41:57,372 INFO L130 PetriNetUnfolder]: For 48/57 co-relation queries the response was YES. [2021-03-25 04:41:57,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 239 events. 72/239 cut-off events. For 48/57 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1409 event pairs, 34 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 496. Up to 117 conditions per place. [2021-03-25 04:41:57,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 358 [2021-03-25 04:41:57,736 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:41:57,918 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:41:58,237 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:41:58,381 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:41:58,406 INFO L154 LiptonReduction]: Checked pairs total: 542 [2021-03-25 04:41:58,406 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:41:58,406 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1062 [2021-03-25 04:41:58,407 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 120 flow [2021-03-25 04:41:58,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 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 04:41:58,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:58,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:58,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:41:58,408 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 04:41:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1106927074, now seen corresponding path program 1 times [2021-03-25 04:41:58,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:58,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136509657] [2021-03-25 04:41:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:58,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:58,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:58,469 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 04:41:58,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136509657] [2021-03-25 04:41:58,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:58,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:58,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118888887] [2021-03-25 04:41:58,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:41:58,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:41:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:41:58,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 190 [2021-03-25 04:41:58,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:58,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 190 [2021-03-25 04:41:58,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:58,499 INFO L129 PetriNetUnfolder]: 57/190 cut-off events. [2021-03-25 04:41:58,500 INFO L130 PetriNetUnfolder]: For 95/112 co-relation queries the response was YES. [2021-03-25 04:41:58,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 190 events. 57/190 cut-off events. For 95/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 952 event pairs, 24 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 433. Up to 96 conditions per place. [2021-03-25 04:41:58,501 INFO L132 encePairwiseOnDemand]: 187/190 looper letters, 1 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 04:41:58,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 128 flow [2021-03-25 04:41:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:41:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:41:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-25 04:41:58,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8912280701754386 [2021-03-25 04:41:58,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-25 04:41:58,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-25 04:41:58,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:58,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-25 04:41:58,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 04:41:58,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 04:41:58,506 INFO L185 Difference]: Start difference. First operand has 37 places, 30 transitions, 120 flow. Second operand 3 states and 508 transitions. [2021-03-25 04:41:58,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 128 flow [2021-03-25 04:41:58,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 102 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-25 04:41:58,514 INFO L241 Difference]: Finished difference. Result has 36 places, 30 transitions, 105 flow [2021-03-25 04:41:58,514 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2021-03-25 04:41:58,514 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -17 predicate places. [2021-03-25 04:41:58,514 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:58,515 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 105 flow [2021-03-25 04:41:58,515 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 105 flow [2021-03-25 04:41:58,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 105 flow [2021-03-25 04:41:58,536 INFO L129 PetriNetUnfolder]: 57/202 cut-off events. [2021-03-25 04:41:58,536 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-25 04:41:58,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 202 events. 57/202 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1147 event pairs, 26 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 357. Up to 96 conditions per place. [2021-03-25 04:41:58,538 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-25 04:41:58,549 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-25 04:41:58,549 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:58,549 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 04:41:58,550 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 105 flow [2021-03-25 04:41:58,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,551 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:58,551 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:58,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:41:58,551 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 04:41:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 70632571, now seen corresponding path program 1 times [2021-03-25 04:41:58,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:58,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669557773] [2021-03-25 04:41:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:58,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:58,596 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:58,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:58,610 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 04:41:58,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669557773] [2021-03-25 04:41:58,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:58,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:58,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543496404] [2021-03-25 04:41:58,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:58,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:58,612 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 190 [2021-03-25 04:41:58,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:58,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 190 [2021-03-25 04:41:58,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:58,665 INFO L129 PetriNetUnfolder]: 51/176 cut-off events. [2021-03-25 04:41:58,665 INFO L130 PetriNetUnfolder]: For 46/90 co-relation queries the response was YES. [2021-03-25 04:41:58,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 176 events. 51/176 cut-off events. For 46/90 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 863 event pairs, 23 based on Foata normal form. 7/179 useless extension candidates. Maximal degree in co-relation 424. Up to 88 conditions per place. [2021-03-25 04:41:58,687 INFO L132 encePairwiseOnDemand]: 182/190 looper letters, 8 selfloop transitions, 11 changer transitions 0/35 dead transitions. [2021-03-25 04:41:58,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 166 flow [2021-03-25 04:41:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:41:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:41:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-03-25 04:41:58,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7973684210526316 [2021-03-25 04:41:58,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-03-25 04:41:58,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-03-25 04:41:58,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:58,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-03-25 04:41:58,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 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 04:41:58,694 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 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 04:41:58,694 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 105 flow. Second operand 4 states and 606 transitions. [2021-03-25 04:41:58,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 166 flow [2021-03-25 04:41:58,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:58,696 INFO L241 Difference]: Finished difference. Result has 39 places, 34 transitions, 157 flow [2021-03-25 04:41:58,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2021-03-25 04:41:58,697 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -14 predicate places. [2021-03-25 04:41:58,697 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:58,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 157 flow [2021-03-25 04:41:58,697 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 157 flow [2021-03-25 04:41:58,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 157 flow [2021-03-25 04:41:58,725 INFO L129 PetriNetUnfolder]: 51/170 cut-off events. [2021-03-25 04:41:58,725 INFO L130 PetriNetUnfolder]: For 92/98 co-relation queries the response was YES. [2021-03-25 04:41:58,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 170 events. 51/170 cut-off events. For 92/98 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 833 event pairs, 24 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 396. Up to 88 conditions per place. [2021-03-25 04:41:58,727 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-25 04:41:58,735 INFO L154 LiptonReduction]: Checked pairs total: 344 [2021-03-25 04:41:58,735 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:58,735 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 04:41:58,737 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 157 flow [2021-03-25 04:41:58,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:58,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:58,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:58,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:41:58,738 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 04:41:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1106709309, now seen corresponding path program 1 times [2021-03-25 04:41:58,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:58,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569277790] [2021-03-25 04:41:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:58,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:58,800 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:58,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:58,812 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 04:41:58,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569277790] [2021-03-25 04:41:58,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:58,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:58,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094900758] [2021-03-25 04:41:58,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:58,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:58,814 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 190 [2021-03-25 04:41:58,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 04:41:58,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:58,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 190 [2021-03-25 04:41:58,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:58,859 INFO L129 PetriNetUnfolder]: 39/152 cut-off events. [2021-03-25 04:41:58,859 INFO L130 PetriNetUnfolder]: For 109/192 co-relation queries the response was YES. [2021-03-25 04:41:58,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 152 events. 39/152 cut-off events. For 109/192 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 706 event pairs, 12 based on Foata normal form. 11/159 useless extension candidates. Maximal degree in co-relation 421. Up to 70 conditions per place. [2021-03-25 04:41:58,861 INFO L132 encePairwiseOnDemand]: 183/190 looper letters, 16 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2021-03-25 04:41:58,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 234 flow [2021-03-25 04:41:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:41:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:41:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2021-03-25 04:41:58,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7934210526315789 [2021-03-25 04:41:58,863 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2021-03-25 04:41:58,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2021-03-25 04:41:58,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:58,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2021-03-25 04:41:58,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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 04:41:58,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 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 04:41:58,867 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 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 04:41:58,867 INFO L185 Difference]: Start difference. First operand has 39 places, 34 transitions, 157 flow. Second operand 4 states and 603 transitions. [2021-03-25 04:41:58,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 234 flow [2021-03-25 04:41:58,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:41:58,870 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 215 flow [2021-03-25 04:41:58,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2021-03-25 04:41:58,870 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2021-03-25 04:41:58,870 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:58,870 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 215 flow [2021-03-25 04:41:58,870 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 215 flow [2021-03-25 04:41:58,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 215 flow [2021-03-25 04:41:58,891 INFO L129 PetriNetUnfolder]: 39/162 cut-off events. [2021-03-25 04:41:58,891 INFO L130 PetriNetUnfolder]: For 182/188 co-relation queries the response was YES. [2021-03-25 04:41:58,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 162 events. 39/162 cut-off events. For 182/188 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 831 event pairs, 15 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 421. Up to 70 conditions per place. [2021-03-25 04:41:58,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 430 [2021-03-25 04:41:58,898 INFO L154 LiptonReduction]: Checked pairs total: 472 [2021-03-25 04:41:58,898 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:58,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 04:41:58,899 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 215 flow [2021-03-25 04:41:58,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 04:41:58,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:58,900 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:58,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:41:58,900 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 04:41:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 51720148, now seen corresponding path program 1 times [2021-03-25 04:41:58,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:58,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866888449] [2021-03-25 04:41:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:58,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:58,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:58,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:58,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:58,980 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 04:41:58,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866888449] [2021-03-25 04:41:58,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:58,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:58,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135798375] [2021-03-25 04:41:58,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:58,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:58,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 190 [2021-03-25 04:41:58,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 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 04:41:58,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:58,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 190 [2021-03-25 04:41:58,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:59,077 INFO L129 PetriNetUnfolder]: 213/521 cut-off events. [2021-03-25 04:41:59,077 INFO L130 PetriNetUnfolder]: For 251/270 co-relation queries the response was YES. [2021-03-25 04:41:59,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 521 events. 213/521 cut-off events. For 251/270 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3492 event pairs, 64 based on Foata normal form. 42/470 useless extension candidates. Maximal degree in co-relation 1196. Up to 327 conditions per place. [2021-03-25 04:41:59,082 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 10 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2021-03-25 04:41:59,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 273 flow [2021-03-25 04:41:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2021-03-25 04:41:59,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8526315789473684 [2021-03-25 04:41:59,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 810 transitions. [2021-03-25 04:41:59,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 810 transitions. [2021-03-25 04:41:59,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:59,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 810 transitions. [2021-03-25 04:41:59,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 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 04:41:59,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:41:59,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:41:59,090 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 215 flow. Second operand 5 states and 810 transitions. [2021-03-25 04:41:59,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 273 flow [2021-03-25 04:41:59,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 268 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:41:59,095 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 270 flow [2021-03-25 04:41:59,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2021-03-25 04:41:59,096 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2021-03-25 04:41:59,096 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:59,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 270 flow [2021-03-25 04:41:59,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 270 flow [2021-03-25 04:41:59,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 270 flow [2021-03-25 04:41:59,141 INFO L129 PetriNetUnfolder]: 151/414 cut-off events. [2021-03-25 04:41:59,142 INFO L130 PetriNetUnfolder]: For 388/448 co-relation queries the response was YES. [2021-03-25 04:41:59,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 414 events. 151/414 cut-off events. For 388/448 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2749 event pairs, 58 based on Foata normal form. 12/394 useless extension candidates. Maximal degree in co-relation 1203. Up to 213 conditions per place. [2021-03-25 04:41:59,147 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-25 04:41:59,169 INFO L154 LiptonReduction]: Checked pairs total: 977 [2021-03-25 04:41:59,170 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:41:59,170 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-25 04:41:59,171 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 264 flow [2021-03-25 04:41:59,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 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 04:41:59,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:59,172 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:59,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:41:59,172 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 04:41:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1943580196, now seen corresponding path program 1 times [2021-03-25 04:41:59,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:59,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618961739] [2021-03-25 04:41:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:59,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:59,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,247 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:59,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:59,259 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 04:41:59,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618961739] [2021-03-25 04:41:59,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:59,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:59,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229965940] [2021-03-25 04:41:59,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:59,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:59,262 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 190 [2021-03-25 04:41:59,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:59,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:59,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 190 [2021-03-25 04:41:59,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:59,366 INFO L129 PetriNetUnfolder]: 176/463 cut-off events. [2021-03-25 04:41:59,366 INFO L130 PetriNetUnfolder]: For 639/741 co-relation queries the response was YES. [2021-03-25 04:41:59,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 463 events. 176/463 cut-off events. For 639/741 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2965 event pairs, 63 based on Foata normal form. 21/455 useless extension candidates. Maximal degree in co-relation 1452. Up to 238 conditions per place. [2021-03-25 04:41:59,370 INFO L132 encePairwiseOnDemand]: 181/190 looper letters, 12 selfloop transitions, 23 changer transitions 0/53 dead transitions. [2021-03-25 04:41:59,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 412 flow [2021-03-25 04:41:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2021-03-25 04:41:59,372 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7726315789473684 [2021-03-25 04:41:59,372 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2021-03-25 04:41:59,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2021-03-25 04:41:59,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:59,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2021-03-25 04:41:59,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 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 04:41:59,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:41:59,376 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:41:59,376 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 264 flow. Second operand 5 states and 734 transitions. [2021-03-25 04:41:59,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 412 flow [2021-03-25 04:41:59,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 406 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:59,382 INFO L241 Difference]: Finished difference. Result has 54 places, 51 transitions, 417 flow [2021-03-25 04:41:59,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2021-03-25 04:41:59,383 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2021-03-25 04:41:59,383 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:59,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 417 flow [2021-03-25 04:41:59,383 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 417 flow [2021-03-25 04:41:59,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 417 flow [2021-03-25 04:41:59,428 INFO L129 PetriNetUnfolder]: 175/474 cut-off events. [2021-03-25 04:41:59,429 INFO L130 PetriNetUnfolder]: For 647/688 co-relation queries the response was YES. [2021-03-25 04:41:59,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 474 events. 175/474 cut-off events. For 647/688 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3185 event pairs, 61 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1442. Up to 247 conditions per place. [2021-03-25 04:41:59,435 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-25 04:41:59,452 INFO L154 LiptonReduction]: Checked pairs total: 520 [2021-03-25 04:41:59,452 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:59,452 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-25 04:41:59,454 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 417 flow [2021-03-25 04:41:59,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:59,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:59,455 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:59,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:41:59,455 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 04:41:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2061970816, now seen corresponding path program 2 times [2021-03-25 04:41:59,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:59,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961234594] [2021-03-25 04:41:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:59,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:59,516 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 04:41:59,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961234594] [2021-03-25 04:41:59,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:59,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:41:59,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613835350] [2021-03-25 04:41:59,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:41:59,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:41:59,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:41:59,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 190 [2021-03-25 04:41:59,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 04:41:59,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:59,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 190 [2021-03-25 04:41:59,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:59,611 INFO L129 PetriNetUnfolder]: 189/495 cut-off events. [2021-03-25 04:41:59,611 INFO L130 PetriNetUnfolder]: For 695/955 co-relation queries the response was YES. [2021-03-25 04:41:59,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 495 events. 189/495 cut-off events. For 695/955 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3229 event pairs, 12 based on Foata normal form. 97/545 useless extension candidates. Maximal degree in co-relation 1719. Up to 282 conditions per place. [2021-03-25 04:41:59,616 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 8 selfloop transitions, 11 changer transitions 3/63 dead transitions. [2021-03-25 04:41:59,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 523 flow [2021-03-25 04:41:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:41:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:41:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 972 transitions. [2021-03-25 04:41:59,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8526315789473684 [2021-03-25 04:41:59,619 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 972 transitions. [2021-03-25 04:41:59,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 972 transitions. [2021-03-25 04:41:59,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:59,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 972 transitions. [2021-03-25 04:41:59,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 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 04:41:59,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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 04:41:59,623 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 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 04:41:59,623 INFO L185 Difference]: Start difference. First operand has 54 places, 51 transitions, 417 flow. Second operand 6 states and 972 transitions. [2021-03-25 04:41:59,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 523 flow [2021-03-25 04:41:59,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:41:59,628 INFO L241 Difference]: Finished difference. Result has 62 places, 58 transitions, 505 flow [2021-03-25 04:41:59,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2021-03-25 04:41:59,628 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2021-03-25 04:41:59,628 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:59,628 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 58 transitions, 505 flow [2021-03-25 04:41:59,628 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 58 transitions, 505 flow [2021-03-25 04:41:59,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 58 transitions, 505 flow [2021-03-25 04:41:59,669 INFO L129 PetriNetUnfolder]: 103/354 cut-off events. [2021-03-25 04:41:59,669 INFO L130 PetriNetUnfolder]: For 879/939 co-relation queries the response was YES. [2021-03-25 04:41:59,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 354 events. 103/354 cut-off events. For 879/939 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2312 event pairs, 10 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1421. Up to 195 conditions per place. [2021-03-25 04:41:59,674 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 04:41:59,705 INFO L154 LiptonReduction]: Checked pairs total: 1384 [2021-03-25 04:41:59,706 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:41:59,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-25 04:41:59,706 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 497 flow [2021-03-25 04:41:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 04:41:59,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:59,707 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 04:41:59,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:41:59,707 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 04:41:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2134344540, now seen corresponding path program 1 times [2021-03-25 04:41:59,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:59,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846235767] [2021-03-25 04:41:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:59,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:59,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:59,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:59,872 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 04:41:59,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846235767] [2021-03-25 04:41:59,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:59,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:41:59,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976455093] [2021-03-25 04:41:59,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:41:59,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:41:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:41:59,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 190 [2021-03-25 04:41:59,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 497 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 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 04:41:59,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:59,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 190 [2021-03-25 04:41:59,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:59,972 INFO L129 PetriNetUnfolder]: 149/372 cut-off events. [2021-03-25 04:41:59,972 INFO L130 PetriNetUnfolder]: For 1056/1261 co-relation queries the response was YES. [2021-03-25 04:41:59,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 372 events. 149/372 cut-off events. For 1056/1261 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2116 event pairs, 4 based on Foata normal form. 59/386 useless extension candidates. Maximal degree in co-relation 1554. Up to 191 conditions per place. [2021-03-25 04:41:59,976 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 5 selfloop transitions, 11 changer transitions 4/61 dead transitions. [2021-03-25 04:41:59,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 543 flow [2021-03-25 04:41:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:41:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:41:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1128 transitions. [2021-03-25 04:41:59,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8481203007518797 [2021-03-25 04:41:59,978 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1128 transitions. [2021-03-25 04:41:59,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1128 transitions. [2021-03-25 04:41:59,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:59,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1128 transitions. [2021-03-25 04:41:59,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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 04:41:59,985 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 04:41:59,985 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 04:41:59,985 INFO L185 Difference]: Start difference. First operand has 62 places, 57 transitions, 497 flow. Second operand 7 states and 1128 transitions. [2021-03-25 04:41:59,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 543 flow [2021-03-25 04:41:59,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 509 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-25 04:41:59,993 INFO L241 Difference]: Finished difference. Result has 64 places, 55 transitions, 475 flow [2021-03-25 04:41:59,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=475, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2021-03-25 04:41:59,993 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2021-03-25 04:41:59,993 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:59,993 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 475 flow [2021-03-25 04:41:59,993 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 475 flow [2021-03-25 04:41:59,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 475 flow [2021-03-25 04:42:00,021 INFO L129 PetriNetUnfolder]: 64/233 cut-off events. [2021-03-25 04:42:00,021 INFO L130 PetriNetUnfolder]: For 562/577 co-relation queries the response was YES. [2021-03-25 04:42:00,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 233 events. 64/233 cut-off events. For 562/577 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1272 event pairs, 4 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 922. Up to 64 conditions per place. [2021-03-25 04:42:00,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-25 04:42:00,342 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:42:00,471 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:42:00,825 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:42:00,997 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:42:01,010 INFO L154 LiptonReduction]: Checked pairs total: 1617 [2021-03-25 04:42:01,011 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:42:01,011 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1018 [2021-03-25 04:42:01,011 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 461 flow [2021-03-25 04:42:01,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 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 04:42:01,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:42:01,012 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:42:01,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:42:01,012 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 04:42:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:42:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1625754895, now seen corresponding path program 1 times [2021-03-25 04:42:01,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:42:01,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214590831] [2021-03-25 04:42:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:42:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:42:01,078 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:42:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:42:01,155 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:42:01,207 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:42:01,207 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:42:01,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:42:01,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:42:01 BasicIcfg [2021-03-25 04:42:01,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:42:01,325 INFO L168 Benchmark]: Toolchain (without parser) took 11006.68 ms. Allocated memory was 255.9 MB in the beginning and 536.9 MB in the end (delta: 281.0 MB). Free memory was 235.4 MB in the beginning and 243.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,325 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 168.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:42:01,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.58 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.8 MB in the beginning and 315.5 MB in the end (delta: -80.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 356.5 MB. Free memory was 315.5 MB in the beginning and 313.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,326 INFO L168 Benchmark]: Boogie Preprocessor took 47.56 ms. Allocated memory is still 356.5 MB. Free memory was 313.0 MB in the beginning and 310.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,326 INFO L168 Benchmark]: RCFGBuilder took 1619.17 ms. Allocated memory is still 356.5 MB. Free memory was 310.9 MB in the beginning and 332.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,326 INFO L168 Benchmark]: TraceAbstraction took 8782.44 ms. Allocated memory was 356.5 MB in the beginning and 536.9 MB in the end (delta: 180.4 MB). Free memory was 332.6 MB in the beginning and 243.6 MB in the end (delta: 89.0 MB). Peak memory consumption was 268.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:01,328 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.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 168.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 510.58 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.8 MB in the beginning and 315.5 MB in the end (delta: -80.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 356.5 MB. Free memory was 315.5 MB in the beginning and 313.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.56 ms. Allocated memory is still 356.5 MB. Free memory was 313.0 MB in the beginning and 310.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1619.17 ms. Allocated memory is still 356.5 MB. Free memory was 310.9 MB in the beginning and 332.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8782.44 ms. Allocated memory was 356.5 MB in the beginning and 536.9 MB in the end (delta: 180.4 MB). Free memory was 332.6 MB in the beginning and 243.6 MB in the end (delta: 89.0 MB). Peak memory consumption was 268.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2394.7ms, 111 PlacesBefore, 53 PlacesAfterwards, 103 TransitionsBefore, 44 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 3138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1657, positive: 1585, positive conditional: 0, positive unconditional: 1585, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 985, positive: 958, positive conditional: 0, positive unconditional: 958, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 985, positive: 958, positive conditional: 0, positive unconditional: 958, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1657, positive: 627, positive conditional: 0, positive unconditional: 627, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 985, unknown conditional: 0, unknown unconditional: 985] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1541.9ms, 50 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 26 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 2314 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 661, positive: 524, positive conditional: 0, positive unconditional: 524, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 661, positive: 462, positive conditional: 0, positive unconditional: 462, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 76, unknown conditional: 0, unknown unconditional: 76] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1061.2ms, 41 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 94, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.4ms, 36 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 24, positive conditional: 0, positive unconditional: 24, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 344 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 17, negative conditional: 0, negative unconditional: 17, 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: 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] , Cache Queries: [ total: 60, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.7ms, 45 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 22, negative conditional: 0, negative unconditional: 22, 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: 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] , Cache Queries: [ total: 116, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 977 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 158, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.0ms, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 19, negative conditional: 0, negative unconditional: 19, 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: 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] , Cache Queries: [ total: 48, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.3ms, 62 PlacesBefore, 62 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1384 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 74, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1017.2ms, 64 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1617 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 277, positive: 199, positive conditional: 0, positive unconditional: 199, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t879; [L854] FCALL, FORK 0 pthread_create(&t879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t880; [L856] FCALL, FORK 0 pthread_create(&t880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L857] 0 pthread_t t881; [L858] FCALL, FORK 0 pthread_create(&t881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(x == 2 && __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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8555.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 906.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2463.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 70 SDtfs, 40 SDslu, 39 SDs, 0 SdLazy, 156 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 175.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 122.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=8, InterpolantAutomatonStates: 42, 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: 31.7ms SsaConstructionTime, 341.8ms SatisfiabilityAnalysisTime, 527.1ms InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...