/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:44:19,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:44:19,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:44:19,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:44:19,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:44:19,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:44:19,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:44:19,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:44:19,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:44:19,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:44:19,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:44:19,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:44:19,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:44:19,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:44:19,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:44:19,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:44:19,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:44:19,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:44:19,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:44:19,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:44:19,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:44:19,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:44:19,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:44:19,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:44:19,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:44:19,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:44:19,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:44:19,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:44:19,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:44:19,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:44:19,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:44:19,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:44:19,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:44:19,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:44:19,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:44:19,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:44:19,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:44:19,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:44:19,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:44:19,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:44:19,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:44:19,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:44:19,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:44:19,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:44:19,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:44:19,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:44:19,919 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:44:19,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:44:19,919 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:44:19,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:44:19,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:44:19,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:44:19,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:44:19,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:44:19,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:44:19,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:44:19,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:44:19,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:44:19,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:44:19,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:44:19,923 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:44:20,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:44:20,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:44:20,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:44:20,263 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:44:20,263 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:44:20,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc.i [2021-03-25 14:44:20,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4773920a6/230f94a5f45446868236bf0277bbefb9/FLAG6525deb14 [2021-03-25 14:44:20,855 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:44:20,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc.i [2021-03-25 14:44:20,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4773920a6/230f94a5f45446868236bf0277bbefb9/FLAG6525deb14 [2021-03-25 14:44:21,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4773920a6/230f94a5f45446868236bf0277bbefb9 [2021-03-25 14:44:21,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:44:21,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:44:21,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:44:21,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:44:21,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:44:21,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0e43ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21, skipping insertion in model container [2021-03-25 14:44:21,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:44:21,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:44:21,360 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/rfi006_pso.oepc.i[949,962] [2021-03-25 14:44:21,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:44:21,611 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:44:21,620 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/rfi006_pso.oepc.i[949,962] [2021-03-25 14:44:21,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:44:21,723 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:44:21,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21 WrapperNode [2021-03-25 14:44:21,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:44:21,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:44:21,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:44:21,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:44:21,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:44:21,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:44:21,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:44:21,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:44:21,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... [2021-03-25 14:44:21,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:44:21,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:44:21,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:44:21,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:44:21,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:44:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:44:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:44:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:44:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:44:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:44:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:44:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:44:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:44:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:44:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:44:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:44:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:44:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:44:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:44:21,973 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:44:24,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:44:24,213 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:44:24,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:44:24 BoogieIcfgContainer [2021-03-25 14:44:24,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:44:24,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:44:24,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:44:24,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:44:24,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:44:21" (1/3) ... [2021-03-25 14:44:24,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d1ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:44:24, skipping insertion in model container [2021-03-25 14:44:24,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:21" (2/3) ... [2021-03-25 14:44:24,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d1ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:44:24, skipping insertion in model container [2021-03-25 14:44:24,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:44:24" (3/3) ... [2021-03-25 14:44:24,229 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc.i [2021-03-25 14:44:24,235 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:44:24,239 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:44:24,240 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,297 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,297 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,298 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,298 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,334 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:24,341 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:44:24,357 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:44:24,384 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:44:24,385 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:44:24,385 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:44:24,385 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:44:24,385 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:44:24,385 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:44:24,385 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:44:24,386 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:44:24,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:44:24,473 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:44:24,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:24,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:44:24,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:44:24,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-25 14:44:24,496 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:24,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:44:24,510 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:44:24,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-25 14:44:24,544 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:44:24,544 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:24,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:44:24,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 1690 [2021-03-25 14:44:25,909 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:44:26,298 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:44:26,416 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:44:27,543 WARN L205 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 14:44:27,850 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:44:29,158 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:44:29,782 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:44:30,253 INFO L154 LiptonReduction]: Checked pairs total: 2757 [2021-03-25 14:44:30,253 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-25 14:44:30,255 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5760 [2021-03-25 14:44:30,263 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-25 14:44:30,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:30,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:30,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:30,264 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1947078235, now seen corresponding path program 1 times [2021-03-25 14:44:30,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:30,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751593349] [2021-03-25 14:44:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:30,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:30,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:30,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:30,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:30,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751593349] [2021-03-25 14:44:30,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:30,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:44:30,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212798527] [2021-03-25 14:44:30,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:44:30,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:44:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:44:30,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2021-03-25 14:44:30,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:30,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:30,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2021-03-25 14:44:30,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:30,625 INFO L129 PetriNetUnfolder]: 69/189 cut-off events. [2021-03-25 14:44:30,625 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:30,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 189 events. 69/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 892 event pairs, 9 based on Foata normal form. 14/192 useless extension candidates. Maximal degree in co-relation 295. Up to 97 conditions per place. [2021-03-25 14:44:30,629 INFO L132 encePairwiseOnDemand]: 153/157 looper letters, 10 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-25 14:44:30,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 119 flow [2021-03-25 14:44:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:44:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:44:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2021-03-25 14:44:30,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8853503184713376 [2021-03-25 14:44:30,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2021-03-25 14:44:30,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2021-03-25 14:44:30,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:30,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2021-03-25 14:44:30,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:30,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:30,671 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 3 states and 417 transitions. [2021-03-25 14:44:30,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 119 flow [2021-03-25 14:44:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:30,676 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2021-03-25 14:44:30,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2021-03-25 14:44:30,678 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 14:44:30,678 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:30,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 14:44:30,679 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 14:44:30,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 88 flow [2021-03-25 14:44:30,687 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-25 14:44:30,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:30,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:44:30,689 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-25 14:44:31,073 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:44:31,196 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:44:31,641 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:44:31,922 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:44:32,586 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:44:33,140 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:44:33,960 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 14:44:34,263 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 14:44:34,882 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-25 14:44:35,536 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-25 14:44:36,143 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-03-25 14:44:36,744 INFO L154 LiptonReduction]: Checked pairs total: 1596 [2021-03-25 14:44:36,744 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-25 14:44:36,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6066 [2021-03-25 14:44:36,745 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:44:36,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:36,745 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 14:44:36,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:44:36,746 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1504232404, now seen corresponding path program 1 times [2021-03-25 14:44:36,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:36,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440334657] [2021-03-25 14:44:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:36,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:36,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:36,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:44:36,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:44:36,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:44:36,929 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:44:36,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:44:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:36,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440334657] [2021-03-25 14:44:36,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:36,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:44:36,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285901279] [2021-03-25 14:44:36,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:44:36,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:44:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:44:36,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 173 [2021-03-25 14:44:36,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:36,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 173 [2021-03-25 14:44:36,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:37,148 INFO L129 PetriNetUnfolder]: 164/315 cut-off events. [2021-03-25 14:44:37,149 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-25 14:44:37,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 315 events. 164/315 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1456 event pairs, 77 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 599. Up to 184 conditions per place. [2021-03-25 14:44:37,159 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 9 selfloop transitions, 9 changer transitions 16/47 dead transitions. [2021-03-25 14:44:37,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 176 flow [2021-03-25 14:44:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:44:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:44:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2021-03-25 14:44:37,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7795210569777044 [2021-03-25 14:44:37,164 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2021-03-25 14:44:37,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2021-03-25 14:44:37,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:37,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2021-03-25 14:44:37,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,176 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,176 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 7 states and 944 transitions. [2021-03-25 14:44:37,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 176 flow [2021-03-25 14:44:37,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:37,177 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 112 flow [2021-03-25 14:44:37,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-25 14:44:37,178 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2021-03-25 14:44:37,178 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:37,178 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-25 14:44:37,178 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-25 14:44:37,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 112 flow [2021-03-25 14:44:37,191 INFO L129 PetriNetUnfolder]: 24/96 cut-off events. [2021-03-25 14:44:37,191 INFO L130 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2021-03-25 14:44:37,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 96 events. 24/96 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 402 event pairs, 6 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 182. Up to 31 conditions per place. [2021-03-25 14:44:37,196 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:44:37,556 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 14:44:37,692 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:44:38,063 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 14:44:38,252 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:44:38,256 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 14:44:38,256 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:44:38,257 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1079 [2021-03-25 14:44:38,257 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 110 flow [2021-03-25 14:44:38,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,258 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:38,258 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:38,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:44:38,259 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 894375480, now seen corresponding path program 1 times [2021-03-25 14:44:38,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:38,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722000304] [2021-03-25 14:44:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:38,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:38,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:38,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722000304] [2021-03-25 14:44:38,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:38,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:44:38,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943753439] [2021-03-25 14:44:38,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:44:38,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:44:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:44:38,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 174 [2021-03-25 14:44:38,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:38,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 174 [2021-03-25 14:44:38,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:38,428 INFO L129 PetriNetUnfolder]: 23/96 cut-off events. [2021-03-25 14:44:38,428 INFO L130 PetriNetUnfolder]: For 41/43 co-relation queries the response was YES. [2021-03-25 14:44:38,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 96 events. 23/96 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 382 event pairs, 5 based on Foata normal form. 5/97 useless extension candidates. Maximal degree in co-relation 193. Up to 30 conditions per place. [2021-03-25 14:44:38,430 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 2 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-25 14:44:38,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 118 flow [2021-03-25 14:44:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:44:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:44:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 14:44:38,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.89272030651341 [2021-03-25 14:44:38,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 14:44:38,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 14:44:38,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:38,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 14:44:38,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,436 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 14:44:38,436 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 14:44:38,436 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 110 flow. Second operand 3 states and 466 transitions. [2021-03-25 14:44:38,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 118 flow [2021-03-25 14:44:38,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 114 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:38,438 INFO L241 Difference]: Finished difference. Result has 36 places, 29 transitions, 116 flow [2021-03-25 14:44:38,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2021-03-25 14:44:38,439 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2021-03-25 14:44:38,439 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:38,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 116 flow [2021-03-25 14:44:38,439 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 116 flow [2021-03-25 14:44:38,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 116 flow [2021-03-25 14:44:38,455 INFO L129 PetriNetUnfolder]: 26/92 cut-off events. [2021-03-25 14:44:38,455 INFO L130 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2021-03-25 14:44:38,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 92 events. 26/92 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 7 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 181. Up to 33 conditions per place. [2021-03-25 14:44:38,456 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 14:44:38,459 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-25 14:44:38,459 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:38,459 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 14:44:38,462 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 116 flow [2021-03-25 14:44:38,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:38,463 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:38,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:44:38,463 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:38,464 INFO L82 PathProgramCache]: Analyzing trace with hash 356457970, now seen corresponding path program 1 times [2021-03-25 14:44:38,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:38,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106061226] [2021-03-25 14:44:38,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:38,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:38,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:44:38,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:38,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:44:38,586 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-25 14:44:38,587 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-25 14:44:38,600 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-25 14:44:38,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:44:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:38,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106061226] [2021-03-25 14:44:38,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:38,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:44:38,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132744760] [2021-03-25 14:44:38,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:44:38,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:44:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:44:38,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 174 [2021-03-25 14:44:38,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:38,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 174 [2021-03-25 14:44:38,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:38,794 INFO L129 PetriNetUnfolder]: 302/532 cut-off events. [2021-03-25 14:44:38,794 INFO L130 PetriNetUnfolder]: For 377/421 co-relation queries the response was YES. [2021-03-25 14:44:38,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 532 events. 302/532 cut-off events. For 377/421 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2471 event pairs, 71 based on Foata normal form. 8/529 useless extension candidates. Maximal degree in co-relation 1460. Up to 337 conditions per place. [2021-03-25 14:44:38,798 INFO L132 encePairwiseOnDemand]: 165/174 looper letters, 28 selfloop transitions, 20 changer transitions 0/60 dead transitions. [2021-03-25 14:44:38,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 342 flow [2021-03-25 14:44:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2021-03-25 14:44:38,801 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7519157088122606 [2021-03-25 14:44:38,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2021-03-25 14:44:38,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2021-03-25 14:44:38,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:38,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2021-03-25 14:44:38,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:38,806 INFO L185 Difference]: Start difference. First operand has 36 places, 29 transitions, 116 flow. Second operand 6 states and 785 transitions. [2021-03-25 14:44:38,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 342 flow [2021-03-25 14:44:38,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:38,809 INFO L241 Difference]: Finished difference. Result has 43 places, 49 transitions, 288 flow [2021-03-25 14:44:38,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=43, PETRI_TRANSITIONS=49} [2021-03-25 14:44:38,810 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2021-03-25 14:44:38,810 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:38,810 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 49 transitions, 288 flow [2021-03-25 14:44:38,810 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 49 transitions, 288 flow [2021-03-25 14:44:38,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 49 transitions, 288 flow [2021-03-25 14:44:38,850 INFO L129 PetriNetUnfolder]: 126/281 cut-off events. [2021-03-25 14:44:38,851 INFO L130 PetriNetUnfolder]: For 321/328 co-relation queries the response was YES. [2021-03-25 14:44:38,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 281 events. 126/281 cut-off events. For 321/328 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1459 event pairs, 17 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 828. Up to 110 conditions per place. [2021-03-25 14:44:38,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 14:44:39,078 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 14:44:39,512 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-25 14:44:39,624 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:44:39,660 INFO L154 LiptonReduction]: Checked pairs total: 600 [2021-03-25 14:44:39,660 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:44:39,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 851 [2021-03-25 14:44:39,661 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 49 transitions, 290 flow [2021-03-25 14:44:39,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:39,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:39,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:39,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:44:39,662 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1637999988, now seen corresponding path program 2 times [2021-03-25 14:44:39,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:39,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303956206] [2021-03-25 14:44:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:39,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:39,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:39,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:39,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:39,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303956206] [2021-03-25 14:44:39,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:39,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:44:39,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569097511] [2021-03-25 14:44:39,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:39,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:39,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-25 14:44:39,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 290 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 14:44:39,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:39,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-25 14:44:39,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:39,822 INFO L129 PetriNetUnfolder]: 161/389 cut-off events. [2021-03-25 14:44:39,822 INFO L130 PetriNetUnfolder]: For 1008/1084 co-relation queries the response was YES. [2021-03-25 14:44:39,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 389 events. 161/389 cut-off events. For 1008/1084 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2219 event pairs, 43 based on Foata normal form. 44/406 useless extension candidates. Maximal degree in co-relation 1136. Up to 116 conditions per place. [2021-03-25 14:44:39,825 INFO L132 encePairwiseOnDemand]: 170/175 looper letters, 7 selfloop transitions, 5 changer transitions 12/52 dead transitions. [2021-03-25 14:44:39,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 325 flow [2021-03-25 14:44:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:44:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:44:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-25 14:44:39,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557142857142858 [2021-03-25 14:44:39,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-25 14:44:39,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-25 14:44:39,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:39,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-25 14:44:39,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:39,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:39,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:39,831 INFO L185 Difference]: Start difference. First operand has 43 places, 49 transitions, 290 flow. Second operand 4 states and 599 transitions. [2021-03-25 14:44:39,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 325 flow [2021-03-25 14:44:39,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:44:39,834 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 241 flow [2021-03-25 14:44:39,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2021-03-25 14:44:39,835 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 14:44:39,835 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:39,835 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 241 flow [2021-03-25 14:44:39,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 241 flow [2021-03-25 14:44:39,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 241 flow [2021-03-25 14:44:39,875 INFO L129 PetriNetUnfolder]: 76/265 cut-off events. [2021-03-25 14:44:39,875 INFO L130 PetriNetUnfolder]: For 386/403 co-relation queries the response was YES. [2021-03-25 14:44:39,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 265 events. 76/265 cut-off events. For 386/403 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1684 event pairs, 20 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 720. Up to 82 conditions per place. [2021-03-25 14:44:39,878 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:44:40,454 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 162 [2021-03-25 14:44:40,577 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-25 14:44:41,995 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 331 DAG size of output: 229 [2021-03-25 14:44:42,302 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-03-25 14:44:42,312 INFO L154 LiptonReduction]: Checked pairs total: 186 [2021-03-25 14:44:42,313 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:44:42,313 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2478 [2021-03-25 14:44:42,313 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 243 flow [2021-03-25 14:44:42,314 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 14:44:42,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:42,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:42,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:44:42,314 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1834719809, now seen corresponding path program 1 times [2021-03-25 14:44:42,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:42,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416706456] [2021-03-25 14:44:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:42,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:42,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416706456] [2021-03-25 14:44:42,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:42,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:44:42,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449680175] [2021-03-25 14:44:42,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:44:42,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:44:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:44:42,359 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 176 [2021-03-25 14:44:42,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 243 flow. Second operand has 3 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 14:44:42,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:42,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 176 [2021-03-25 14:44:42,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:42,402 INFO L129 PetriNetUnfolder]: 73/213 cut-off events. [2021-03-25 14:44:42,402 INFO L130 PetriNetUnfolder]: For 625/652 co-relation queries the response was YES. [2021-03-25 14:44:42,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 213 events. 73/213 cut-off events. For 625/652 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1174 event pairs, 21 based on Foata normal form. 12/201 useless extension candidates. Maximal degree in co-relation 654. Up to 71 conditions per place. [2021-03-25 14:44:42,404 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-25 14:44:42,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 244 flow [2021-03-25 14:44:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:44:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:44:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2021-03-25 14:44:42,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2021-03-25 14:44:42,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2021-03-25 14:44:42,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2021-03-25 14:44:42,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:42,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2021-03-25 14:44:42,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,409 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 243 flow. Second operand 3 states and 476 transitions. [2021-03-25 14:44:42,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 244 flow [2021-03-25 14:44:42,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 231 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:42,412 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 238 flow [2021-03-25 14:44:42,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-25 14:44:42,412 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 14:44:42,412 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:42,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 238 flow [2021-03-25 14:44:42,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 238 flow [2021-03-25 14:44:42,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 238 flow [2021-03-25 14:44:42,440 INFO L129 PetriNetUnfolder]: 67/215 cut-off events. [2021-03-25 14:44:42,440 INFO L130 PetriNetUnfolder]: For 297/303 co-relation queries the response was YES. [2021-03-25 14:44:42,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 215 events. 67/215 cut-off events. For 297/303 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1221 event pairs, 16 based on Foata normal form. 2/199 useless extension candidates. Maximal degree in co-relation 661. Up to 68 conditions per place. [2021-03-25 14:44:42,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:44:42,497 INFO L154 LiptonReduction]: Checked pairs total: 131 [2021-03-25 14:44:42,497 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:42,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-25 14:44:42,498 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 238 flow [2021-03-25 14:44:42,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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 14:44:42,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:42,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:42,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:44:42,498 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -732932260, now seen corresponding path program 1 times [2021-03-25 14:44:42,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:42,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446485069] [2021-03-25 14:44:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:42,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,549 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:44:42,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:44:42,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:42,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446485069] [2021-03-25 14:44:42,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:42,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:42,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19396091] [2021-03-25 14:44:42,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:42,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:42,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:42,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-25 14:44:42,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:42,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-25 14:44:42,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:42,630 INFO L129 PetriNetUnfolder]: 180/413 cut-off events. [2021-03-25 14:44:42,630 INFO L130 PetriNetUnfolder]: For 559/597 co-relation queries the response was YES. [2021-03-25 14:44:42,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 413 events. 180/413 cut-off events. For 559/597 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2465 event pairs, 59 based on Foata normal form. 63/432 useless extension candidates. Maximal degree in co-relation 1154. Up to 222 conditions per place. [2021-03-25 14:44:42,633 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 8 selfloop transitions, 8 changer transitions 6/46 dead transitions. [2021-03-25 14:44:42,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 283 flow [2021-03-25 14:44:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:44:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:44:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-25 14:44:42,636 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8613636363636363 [2021-03-25 14:44:42,636 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-25 14:44:42,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-25 14:44:42,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:42,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-25 14:44:42,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,639 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,640 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 238 flow. Second operand 5 states and 758 transitions. [2021-03-25 14:44:42,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 283 flow [2021-03-25 14:44:42,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 265 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:42,642 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 225 flow [2021-03-25 14:44:42,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-25 14:44:42,642 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2021-03-25 14:44:42,643 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:42,643 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 225 flow [2021-03-25 14:44:42,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 225 flow [2021-03-25 14:44:42,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:42,667 INFO L129 PetriNetUnfolder]: 99/235 cut-off events. [2021-03-25 14:44:42,668 INFO L130 PetriNetUnfolder]: For 407/449 co-relation queries the response was YES. [2021-03-25 14:44:42,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 235 events. 99/235 cut-off events. For 407/449 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1152 event pairs, 32 based on Foata normal form. 7/219 useless extension candidates. Maximal degree in co-relation 784. Up to 126 conditions per place. [2021-03-25 14:44:42,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-25 14:44:42,702 INFO L154 LiptonReduction]: Checked pairs total: 234 [2021-03-25 14:44:42,703 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:44:42,703 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-25 14:44:42,703 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 222 flow [2021-03-25 14:44:42,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:42,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:42,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:44:42,704 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash -931254201, now seen corresponding path program 1 times [2021-03-25 14:44:42,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:42,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092192139] [2021-03-25 14:44:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:42,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,803 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:44:42,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:44:42,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:42,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092192139] [2021-03-25 14:44:42,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:42,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:44:42,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065482095] [2021-03-25 14:44:42,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:44:42,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:44:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:44:42,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-25 14:44:42,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:42,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-25 14:44:42,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:42,883 INFO L129 PetriNetUnfolder]: 51/144 cut-off events. [2021-03-25 14:44:42,883 INFO L130 PetriNetUnfolder]: For 399/459 co-relation queries the response was YES. [2021-03-25 14:44:42,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 144 events. 51/144 cut-off events. For 399/459 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 565 event pairs, 5 based on Foata normal form. 40/179 useless extension candidates. Maximal degree in co-relation 551. Up to 84 conditions per place. [2021-03-25 14:44:42,884 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 5 selfloop transitions, 11 changer transitions 3/43 dead transitions. [2021-03-25 14:44:42,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 300 flow [2021-03-25 14:44:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2021-03-25 14:44:42,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615819209039548 [2021-03-25 14:44:42,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2021-03-25 14:44:42,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2021-03-25 14:44:42,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:42,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2021-03-25 14:44:42,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,894 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,894 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 222 flow. Second operand 6 states and 915 transitions. [2021-03-25 14:44:42,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 300 flow [2021-03-25 14:44:42,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 274 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-25 14:44:42,898 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 266 flow [2021-03-25 14:44:42,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-25 14:44:42,898 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2021-03-25 14:44:42,898 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:42,898 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 266 flow [2021-03-25 14:44:42,899 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 266 flow [2021-03-25 14:44:42,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 266 flow [2021-03-25 14:44:42,914 INFO L129 PetriNetUnfolder]: 46/138 cut-off events. [2021-03-25 14:44:42,915 INFO L130 PetriNetUnfolder]: For 344/392 co-relation queries the response was YES. [2021-03-25 14:44:42,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 138 events. 46/138 cut-off events. For 344/392 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 589 event pairs, 5 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 537. Up to 78 conditions per place. [2021-03-25 14:44:42,916 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-25 14:44:42,949 INFO L154 LiptonReduction]: Checked pairs total: 291 [2021-03-25 14:44:42,949 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:44:42,949 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 14:44:42,950 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 259 flow [2021-03-25 14:44:42,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:42,951 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:42,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:44:42,951 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2018606810, now seen corresponding path program 1 times [2021-03-25 14:44:42,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:42,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521340851] [2021-03-25 14:44:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:43,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:43,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:43,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:43,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521340851] [2021-03-25 14:44:43,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:43,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:43,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908276365] [2021-03-25 14:44:43,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:43,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:43,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:43,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:43,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2021-03-25 14:44:43,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:43,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2021-03-25 14:44:43,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:43,080 INFO L129 PetriNetUnfolder]: 53/169 cut-off events. [2021-03-25 14:44:43,080 INFO L130 PetriNetUnfolder]: For 399/404 co-relation queries the response was YES. [2021-03-25 14:44:43,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 169 events. 53/169 cut-off events. For 399/404 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 758 event pairs, 10 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 637. Up to 84 conditions per place. [2021-03-25 14:44:43,082 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 7 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 14:44:43,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 254 flow [2021-03-25 14:44:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:44:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:44:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-03-25 14:44:43,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851123595505618 [2021-03-25 14:44:43,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-03-25 14:44:43,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-03-25 14:44:43,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:43,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-03-25 14:44:43,086 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 14:44:43,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,088 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 259 flow. Second operand 4 states and 606 transitions. [2021-03-25 14:44:43,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 254 flow [2021-03-25 14:44:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 234 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:43,091 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:43,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-25 14:44:43,091 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2021-03-25 14:44:43,091 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:43,091 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:43,092 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:43,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:43,108 INFO L129 PetriNetUnfolder]: 49/153 cut-off events. [2021-03-25 14:44:43,108 INFO L130 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2021-03-25 14:44:43,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 153 events. 49/153 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 658 event pairs, 10 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 503. Up to 54 conditions per place. [2021-03-25 14:44:43,110 INFO L142 LiptonReduction]: Number of co-enabled transitions 170 [2021-03-25 14:44:43,114 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-25 14:44:43,114 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:43,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 14:44:43,115 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 225 flow [2021-03-25 14:44:43,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:43,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:43,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:44:43,116 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 773284701, now seen corresponding path program 1 times [2021-03-25 14:44:43,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:43,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242015974] [2021-03-25 14:44:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:43,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:43,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:43,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:43,227 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:44:43,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:44:43,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:43,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:43,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242015974] [2021-03-25 14:44:43,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:43,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:44:43,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755888036] [2021-03-25 14:44:43,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:44:43,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:44:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:44:43,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 178 [2021-03-25 14:44:43,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:43,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 178 [2021-03-25 14:44:43,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:43,303 INFO L129 PetriNetUnfolder]: 36/125 cut-off events. [2021-03-25 14:44:43,303 INFO L130 PetriNetUnfolder]: For 212/232 co-relation queries the response was YES. [2021-03-25 14:44:43,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 125 events. 36/125 cut-off events. For 212/232 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 506 event pairs, 2 based on Foata normal form. 26/148 useless extension candidates. Maximal degree in co-relation 456. Up to 48 conditions per place. [2021-03-25 14:44:43,304 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 11 changer transitions 14/41 dead transitions. [2021-03-25 14:44:43,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 41 transitions, 287 flow [2021-03-25 14:44:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:44:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:44:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1068 transitions. [2021-03-25 14:44:43,307 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-25 14:44:43,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1068 transitions. [2021-03-25 14:44:43,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1068 transitions. [2021-03-25 14:44:43,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:43,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1068 transitions. [2021-03-25 14:44:43,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.57142857142858) internal successors, (1068), 7 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,313 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:43,313 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 225 flow. Second operand 7 states and 1068 transitions. [2021-03-25 14:44:43,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 41 transitions, 287 flow [2021-03-25 14:44:43,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 255 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:43,316 INFO L241 Difference]: Finished difference. Result has 57 places, 27 transitions, 172 flow [2021-03-25 14:44:43,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2021-03-25 14:44:43,317 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2021-03-25 14:44:43,317 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:43,317 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 27 transitions, 172 flow [2021-03-25 14:44:43,317 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 27 transitions, 172 flow [2021-03-25 14:44:43,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 27 transitions, 172 flow [2021-03-25 14:44:43,325 INFO L129 PetriNetUnfolder]: 9/53 cut-off events. [2021-03-25 14:44:43,325 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-03-25 14:44:43,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 53 events. 9/53 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 2 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 178. Up to 17 conditions per place. [2021-03-25 14:44:43,326 INFO L142 LiptonReduction]: Number of co-enabled transitions 82 [2021-03-25 14:44:43,521 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-25 14:44:43,684 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-25 14:44:44,006 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 14:44:44,300 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 14:44:44,947 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 14:44:45,165 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:44:46,553 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-25 14:44:47,041 WARN L205 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 14:44:47,401 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:44:47,651 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:44:48,167 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:44:48,771 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:44:48,777 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-25 14:44:48,777 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:44:48,777 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5460 [2021-03-25 14:44:48,778 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 22 transitions, 154 flow [2021-03-25 14:44:48,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:48,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:48,778 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:48,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:44:48,779 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1895177055, now seen corresponding path program 1 times [2021-03-25 14:44:48,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:48,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146952085] [2021-03-25 14:44:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:44:48,843 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:44:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:44:48,912 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:44:48,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:44:48,955 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:44:48,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:44:49,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:44:49 BasicIcfg [2021-03-25 14:44:49,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:44:49,050 INFO L168 Benchmark]: Toolchain (without parser) took 27890.89 ms. Allocated memory was 341.8 MB in the beginning and 861.9 MB in the end (delta: 520.1 MB). Free memory was 305.2 MB in the beginning and 771.5 MB in the end (delta: -466.3 MB). Peak memory consumption was 56.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,050 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 341.8 MB. Free memory is still 323.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:44:49,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.23 ms. Allocated memory is still 341.8 MB. Free memory was 305.0 MB in the beginning and 299.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.97 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 296.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,051 INFO L168 Benchmark]: Boogie Preprocessor took 44.80 ms. Allocated memory is still 341.8 MB. Free memory was 296.4 MB in the beginning and 294.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,051 INFO L168 Benchmark]: RCFGBuilder took 2363.90 ms. Allocated memory was 341.8 MB in the beginning and 432.0 MB in the end (delta: 90.2 MB). Free memory was 293.2 MB in the beginning and 399.8 MB in the end (delta: -106.6 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,051 INFO L168 Benchmark]: TraceAbstraction took 24833.21 ms. Allocated memory was 432.0 MB in the beginning and 861.9 MB in the end (delta: 429.9 MB). Free memory was 399.8 MB in the beginning and 771.5 MB in the end (delta: -371.7 MB). Peak memory consumption was 59.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:44:49,053 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.16 ms. Allocated memory is still 341.8 MB. Free memory is still 323.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 564.23 ms. Allocated memory is still 341.8 MB. Free memory was 305.0 MB in the beginning and 299.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.97 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 296.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.80 ms. Allocated memory is still 341.8 MB. Free memory was 296.4 MB in the beginning and 294.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2363.90 ms. Allocated memory was 341.8 MB in the beginning and 432.0 MB in the end (delta: 90.2 MB). Free memory was 293.2 MB in the beginning and 399.8 MB in the end (delta: -106.6 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24833.21 ms. Allocated memory was 432.0 MB in the beginning and 861.9 MB in the end (delta: 429.9 MB). Free memory was 399.8 MB in the beginning and 771.5 MB in the end (delta: -371.7 MB). Peak memory consumption was 59.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5742.8ms, 103 PlacesBefore, 51 PlacesAfterwards, 95 TransitionsBefore, 42 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 4 FixpointIterations, 24 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 59 TotalNumberOfCompositions, 2757 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1131, positive: 1065, positive conditional: 0, positive unconditional: 1065, 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: 892, positive: 859, positive conditional: 0, positive unconditional: 859, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, positive: 859, positive conditional: 0, positive unconditional: 859, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, positive: 857, positive conditional: 0, positive unconditional: 857, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 602, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 597, negative conditional: 0, negative unconditional: 597, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1131, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6064.3ms, 48 PlacesBefore, 33 PlacesAfterwards, 39 TransitionsBefore, 24 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 1596 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 500, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 111, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 111, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 666, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 649, negative conditional: 0, negative unconditional: 649, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 500, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1078.0ms, 41 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 60, positive conditional: 0, positive unconditional: 60, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.9ms, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 850.4ms, 43 PlacesBefore, 43 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2477.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.1ms, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.7ms, 53 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 291 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5459.9ms, 57 PlacesBefore, 47 PlacesAfterwards, 27 TransitionsBefore, 22 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24576.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1107.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5871.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 44 SDtfs, 34 SDslu, 27 SDs, 0 SdLazy, 230 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 271.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 169.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=4, InterpolantAutomatonStates: 48, 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: 46.0ms SsaConstructionTime, 441.0ms SatisfiabilityAnalysisTime, 617.7ms InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...