/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/safe021_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:53:42,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:53:42,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:53:42,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:53:42,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:53:42,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:53:42,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:53:42,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:53:42,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:53:42,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:53:42,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:53:42,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:53:42,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:53:42,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:53:42,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:53:42,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:53:42,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:53:42,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:53:42,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:53:42,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:53:42,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:53:42,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:53:42,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:53:42,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:53:42,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:53:42,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:53:42,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:53:42,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:53:42,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:53:42,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:53:42,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:53:42,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:53:42,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:53:42,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:53:42,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:53:42,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:53:42,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:53:42,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:53:42,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:53:42,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:53:42,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:53:42,902 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-06-11 06:53:42,923 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:53:42,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:53:42,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:53:42,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:53:42,924 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:53:42,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:53:42,924 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:53:42,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:53:42,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:53:42,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:53:42,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:53:42,926 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-06-11 06:53:43,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:53:43,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:53:43,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:53:43,162 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:53:43,162 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:53:43,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2021-06-11 06:53:43,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39978135/d65e6cdb4ffc4f69be64aec607874efc/FLAG101e6022a [2021-06-11 06:53:43,568 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:53:43,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2021-06-11 06:53:43,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39978135/d65e6cdb4ffc4f69be64aec607874efc/FLAG101e6022a [2021-06-11 06:53:43,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39978135/d65e6cdb4ffc4f69be64aec607874efc [2021-06-11 06:53:43,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:53:43,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:53:43,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:53:43,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:53:43,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:53:43,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:53:43" (1/1) ... [2021-06-11 06:53:43,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf88a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:43, skipping insertion in model container [2021-06-11 06:53:43,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:53:43" (1/1) ... [2021-06-11 06:53:43,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:53:44,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:53:44,103 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/safe021_pso.opt.i[949,962] [2021-06-11 06:53:44,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:53:44,278 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:53:44,284 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/safe021_pso.opt.i[949,962] [2021-06-11 06:53:44,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:53:44,376 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:53:44,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44 WrapperNode [2021-06-11 06:53:44,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:53:44,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:53:44,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:53:44,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:53:44,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:53:44,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:53:44,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:53:44,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:53:44,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (1/1) ... [2021-06-11 06:53:44,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:53:44,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:53:44,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:53:44,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:53:44,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (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-06-11 06:53:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:53:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:53:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:53:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:53:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:53:44,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:53:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:53:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:53:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:53:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:53:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:53:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:53:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:53:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:53:44,481 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:53:45,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:53:45,855 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:53:45,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:53:45 BoogieIcfgContainer [2021-06-11 06:53:45,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:53:45,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:53:45,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:53:45,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:53:45,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:53:43" (1/3) ... [2021-06-11 06:53:45,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d39aa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:53:45, skipping insertion in model container [2021-06-11 06:53:45,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:53:44" (2/3) ... [2021-06-11 06:53:45,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d39aa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:53:45, skipping insertion in model container [2021-06-11 06:53:45,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:53:45" (3/3) ... [2021-06-11 06:53:45,860 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_pso.opt.i [2021-06-11 06:53:45,865 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:53:45,867 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:53:45,867 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:53:45,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,899 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,902 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:53:45,904 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:53:45,915 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 06:53:45,926 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:53:45,927 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:53:45,927 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:53:45,927 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:53:45,927 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:53:45,927 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:53:45,927 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:53:45,927 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:53:45,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-06-11 06:53:45,955 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-11 06:53:45,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:45,958 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 68 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-06-11 06:53:45,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-06-11 06:53:45,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-06-11 06:53:45,962 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:53:45,969 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-11 06:53:45,971 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-11 06:53:45,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-06-11 06:53:45,983 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-11 06:53:45,984 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:45,984 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 72 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-06-11 06:53:45,986 INFO L151 LiptonReduction]: Number of co-enabled transitions 1686 [2021-06-11 06:53:46,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:46,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:46,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:46,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:46,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:46,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:46,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:46,769 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-06-11 06:53:47,059 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-06-11 06:53:48,279 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-06-11 06:53:48,833 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 06:53:48,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:48,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:48,995 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:53:48,996 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:53:49,014 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:49,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:49,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:49,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:49,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:49,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:49,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:49,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:49,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:49,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,767 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:53:49,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:49,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:49,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:50,509 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:53:50,869 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 06:53:50,980 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 06:53:50,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:50,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:53:50,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:50,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,994 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:53:50,994 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:53:50,996 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:50,998 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 06:53:50,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:50,999 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 06:53:51,000 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 06:53:51,000 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:53:51,001 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,002 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 06:53:51,003 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 06:53:51,003 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:53:51,004 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,006 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 06:53:51,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:51,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:51,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:51,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:51,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:51,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:51,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,439 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:53:51,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:51,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:51,927 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 06:53:52,213 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 06:53:52,790 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-11 06:53:53,321 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-11 06:53:53,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:53,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:53,659 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:53:53,973 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:53:54,517 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 06:53:55,062 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 06:53:55,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:55,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:55,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:53:55,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:55,215 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:55,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:55,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:53:55,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:53:55,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:55,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:53:55,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:53:55,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:55,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:55,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:56,013 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 06:53:56,401 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 06:53:57,206 WARN L205 SmtUtils]: Spent 802.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-06-11 06:53:57,818 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-11 06:53:58,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:58,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:58,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:58,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:58,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:58,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:58,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:58,526 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-11 06:53:58,650 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-11 06:53:58,947 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-11 06:53:59,083 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-11 06:53:59,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:53:59,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:59,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:53:59,110 INFO L163 LiptonReduction]: Checked pairs total: 5335 [2021-06-11 06:53:59,110 INFO L165 LiptonReduction]: Total number of compositions: 89 [2021-06-11 06:53:59,112 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13151 [2021-06-11 06:53:59,117 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-06-11 06:53:59,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:59,118 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:53:59,118 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 06:53:59,118 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:53:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:53:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1026040306, now seen corresponding path program 1 times [2021-06-11 06:53:59,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:53:59,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594198349] [2021-06-11 06:53:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:53:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:53:59,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:53:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:53:59,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594198349] [2021-06-11 06:53:59,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:53:59,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:53:59,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849228180] [2021-06-11 06:53:59,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:53:59,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:53:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:53:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:53:59,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 187 [2021-06-11 06:53:59,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:53:59,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 187 [2021-06-11 06:53:59,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:53:59,347 INFO L129 PetriNetUnfolder]: 69/142 cut-off events. [2021-06-11 06:53:59,348 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:59,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 142 events. 69/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 596 event pairs, 39 based on Foata normal form. 11/135 useless extension candidates. Maximal degree in co-relation 260. Up to 89 conditions per place. [2021-06-11 06:53:59,350 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 9 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2021-06-11 06:53:59,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 93 flow [2021-06-11 06:53:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:53:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:53:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-06-11 06:53:59,366 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8270944741532977 [2021-06-11 06:53:59,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-06-11 06:53:59,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-06-11 06:53:59,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:53:59,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-06-11 06:53:59,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-06-11 06:53:59,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,381 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 65 flow. Second operand 3 states and 464 transitions. [2021-06-11 06:53:59,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 93 flow [2021-06-11 06:53:59,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 06:53:59,383 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2021-06-11 06:53:59,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-06-11 06:53:59,385 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 06:53:59,385 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:53:59,386 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 56 flow [2021-06-11 06:53:59,387 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 56 flow [2021-06-11 06:53:59,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2021-06-11 06:53:59,389 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 06:53:59,389 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:59,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:53:59,390 INFO L151 LiptonReduction]: Number of co-enabled transitions 256 [2021-06-11 06:53:59,392 INFO L163 LiptonReduction]: Checked pairs total: 282 [2021-06-11 06:53:59,392 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:53:59,392 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 06:53:59,393 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 06:53:59,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:53:59,394 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:53:59,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:53:59,394 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:53:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:53:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1255069563, now seen corresponding path program 1 times [2021-06-11 06:53:59,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:53:59,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222431295] [2021-06-11 06:53:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:53:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:53:59,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:53:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:53:59,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222431295] [2021-06-11 06:53:59,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:53:59,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:53:59,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017346722] [2021-06-11 06:53:59,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:53:59,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:53:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:53:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:53:59,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 187 [2021-06-11 06:53:59,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:53:59,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 187 [2021-06-11 06:53:59,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:53:59,514 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 06:53:59,514 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:59,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:53:59,515 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2021-06-11 06:53:59,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 62 flow [2021-06-11 06:53:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:53:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:53:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-06-11 06:53:59,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8413547237076648 [2021-06-11 06:53:59,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-06-11 06:53:59,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-06-11 06:53:59,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:53:59,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-06-11 06:53:59,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-06-11 06:53:59,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,519 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 472 transitions. [2021-06-11 06:53:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 62 flow [2021-06-11 06:53:59,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:53:59,520 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 56 flow [2021-06-11 06:53:59,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-06-11 06:53:59,520 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 06:53:59,520 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:53:59,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 06:53:59,521 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 06:53:59,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-06-11 06:53:59,523 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 06:53:59,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:53:59,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:53:59,524 INFO L151 LiptonReduction]: Number of co-enabled transitions 214 [2021-06-11 06:53:59,525 INFO L163 LiptonReduction]: Checked pairs total: 248 [2021-06-11 06:53:59,525 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:53:59,525 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-06-11 06:53:59,525 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-06-11 06:53:59,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:53:59,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:53:59,526 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:53:59,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:53:59,526 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:53:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:53:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 251764152, now seen corresponding path program 1 times [2021-06-11 06:53:59,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:53:59,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598187493] [2021-06-11 06:53:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:53:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:53:59,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:53:59,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:53:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:53:59,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598187493] [2021-06-11 06:53:59,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:53:59,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:53:59,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434344997] [2021-06-11 06:53:59,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:53:59,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:53:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:53:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:53:59,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 187 [2021-06-11 06:53:59,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 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-06-11 06:53:59,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:53:59,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 187 [2021-06-11 06:53:59,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:53:59,623 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-11 06:53:59,623 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-06-11 06:53:59,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 28 events. 0/28 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-11 06:53:59,623 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-06-11 06:53:59,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 71 flow [2021-06-11 06:53:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:53:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:53:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-06-11 06:53:59,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8008021390374331 [2021-06-11 06:53:59,625 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-06-11 06:53:59,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-06-11 06:53:59,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:53:59,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-06-11 06:53:59,627 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-06-11 06:53:59,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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-06-11 06:53:59,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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-06-11 06:53:59,629 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 599 transitions. [2021-06-11 06:53:59,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 71 flow [2021-06-11 06:53:59,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:53:59,629 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 66 flow [2021-06-11 06:53:59,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-06-11 06:53:59,630 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-06-11 06:53:59,630 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:53:59,630 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 66 flow [2021-06-11 06:53:59,631 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 66 flow [2021-06-11 06:53:59,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 66 flow [2021-06-11 06:53:59,633 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 06:53:59,633 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 06:53:59,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:53:59,633 INFO L151 LiptonReduction]: Number of co-enabled transitions 194 [2021-06-11 06:53:59,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:53:59,803 INFO L163 LiptonReduction]: Checked pairs total: 383 [2021-06-11 06:53:59,803 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:53:59,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 174 [2021-06-11 06:53:59,804 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 64 flow [2021-06-11 06:53:59,805 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-06-11 06:53:59,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:53:59,805 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:53:59,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:53:59,805 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:53:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:53:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash 814155672, now seen corresponding path program 1 times [2021-06-11 06:53:59,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:53:59,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597596006] [2021-06-11 06:53:59,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:53:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:53:59,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:53:59,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:53:59,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:53:59,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:53:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:53:59,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597596006] [2021-06-11 06:53:59,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:53:59,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:53:59,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582370211] [2021-06-11 06:53:59,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:53:59,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:53:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:53:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:53:59,882 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 188 [2021-06-11 06:53:59,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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-06-11 06:53:59,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:53:59,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 188 [2021-06-11 06:53:59,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:53:59,941 INFO L129 PetriNetUnfolder]: 53/130 cut-off events. [2021-06-11 06:53:59,941 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-06-11 06:53:59,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 130 events. 53/130 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 520 event pairs, 35 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 285. Up to 90 conditions per place. [2021-06-11 06:53:59,942 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 9 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2021-06-11 06:53:59,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 112 flow [2021-06-11 06:53:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:53:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:53:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2021-06-11 06:53:59,944 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2021-06-11 06:53:59,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2021-06-11 06:53:59,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2021-06-11 06:53:59,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:53:59,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2021-06-11 06:53:59,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-06-11 06:53:59,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-06-11 06:53:59,947 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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-06-11 06:53:59,947 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 64 flow. Second operand 4 states and 544 transitions. [2021-06-11 06:53:59,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 112 flow [2021-06-11 06:53:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 97 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 06:53:59,948 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 92 flow [2021-06-11 06:53:59,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-06-11 06:53:59,948 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-06-11 06:53:59,948 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:53:59,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 92 flow [2021-06-11 06:53:59,949 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 92 flow [2021-06-11 06:53:59,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 92 flow [2021-06-11 06:53:59,954 INFO L129 PetriNetUnfolder]: 11/52 cut-off events. [2021-06-11 06:53:59,954 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2021-06-11 06:53:59,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 52 events. 11/52 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 163 event pairs, 6 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 96. Up to 23 conditions per place. [2021-06-11 06:53:59,955 INFO L151 LiptonReduction]: Number of co-enabled transitions 218 [2021-06-11 06:53:59,956 INFO L163 LiptonReduction]: Checked pairs total: 146 [2021-06-11 06:53:59,957 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:53:59,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:53:59,957 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 92 flow [2021-06-11 06:53:59,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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-06-11 06:53:59,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:53:59,958 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:53:59,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:53:59,958 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:53:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:53:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash -182917582, now seen corresponding path program 1 times [2021-06-11 06:53:59,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:53:59,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381901513] [2021-06-11 06:53:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:53:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:54:00,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,004 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:54:00,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:54:00,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:54:00,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381901513] [2021-06-11 06:54:00,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:54:00,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:54:00,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898225168] [2021-06-11 06:54:00,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:54:00,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:54:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:54:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:54:00,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 188 [2021-06-11 06:54:00,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 92 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-06-11 06:54:00,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:54:00,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 188 [2021-06-11 06:54:00,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:54:00,055 INFO L129 PetriNetUnfolder]: 57/150 cut-off events. [2021-06-11 06:54:00,055 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-11 06:54:00,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 150 events. 57/150 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 707 event pairs, 27 based on Foata normal form. 14/154 useless extension candidates. Maximal degree in co-relation 316. Up to 78 conditions per place. [2021-06-11 06:54:00,057 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-06-11 06:54:00,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 144 flow [2021-06-11 06:54:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:54:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:54:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-06-11 06:54:00,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.801063829787234 [2021-06-11 06:54:00,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-06-11 06:54:00,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-06-11 06:54:00,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:54:00,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-06-11 06:54:00,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,062 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 92 flow. Second operand 5 states and 753 transitions. [2021-06-11 06:54:00,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 144 flow [2021-06-11 06:54:00,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:54:00,063 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 152 flow [2021-06-11 06:54:00,064 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-06-11 06:54:00,064 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-06-11 06:54:00,064 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:54:00,064 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 152 flow [2021-06-11 06:54:00,064 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 152 flow [2021-06-11 06:54:00,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 152 flow [2021-06-11 06:54:00,077 INFO L129 PetriNetUnfolder]: 61/157 cut-off events. [2021-06-11 06:54:00,077 INFO L130 PetriNetUnfolder]: For 95/109 co-relation queries the response was YES. [2021-06-11 06:54:00,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 157 events. 61/157 cut-off events. For 95/109 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 753 event pairs, 27 based on Foata normal form. 3/146 useless extension candidates. Maximal degree in co-relation 421. Up to 82 conditions per place. [2021-06-11 06:54:00,079 INFO L151 LiptonReduction]: Number of co-enabled transitions 272 [2021-06-11 06:54:00,096 INFO L163 LiptonReduction]: Checked pairs total: 152 [2021-06-11 06:54:00,096 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:54:00,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 06:54:00,101 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 152 flow [2021-06-11 06:54:00,101 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-06-11 06:54:00,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:54:00,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:54:00,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:54:00,101 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:54:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:54:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1396666357, now seen corresponding path program 1 times [2021-06-11 06:54:00,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:54:00,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537783302] [2021-06-11 06:54:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:54:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:54:00,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,188 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:54:00,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:54:00,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:54:00,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537783302] [2021-06-11 06:54:00,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:54:00,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:54:00,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079731719] [2021-06-11 06:54:00,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:54:00,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:54:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:54:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:54:00,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 188 [2021-06-11 06:54:00,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:54:00,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 188 [2021-06-11 06:54:00,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:54:00,251 INFO L129 PetriNetUnfolder]: 34/114 cut-off events. [2021-06-11 06:54:00,252 INFO L130 PetriNetUnfolder]: For 129/214 co-relation queries the response was YES. [2021-06-11 06:54:00,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 114 events. 34/114 cut-off events. For 129/214 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 488 event pairs, 5 based on Foata normal form. 47/156 useless extension candidates. Maximal degree in co-relation 380. Up to 68 conditions per place. [2021-06-11 06:54:00,252 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 15 changer transitions 3/42 dead transitions. [2021-06-11 06:54:00,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 256 flow [2021-06-11 06:54:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:54:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:54:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-06-11 06:54:00,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8009118541033434 [2021-06-11 06:54:00,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-06-11 06:54:00,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-06-11 06:54:00,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:54:00,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-06-11 06:54:00,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 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-06-11 06:54:00,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 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-06-11 06:54:00,259 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 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-06-11 06:54:00,259 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 152 flow. Second operand 7 states and 1054 transitions. [2021-06-11 06:54:00,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 256 flow [2021-06-11 06:54:00,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:54:00,262 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 247 flow [2021-06-11 06:54:00,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-06-11 06:54:00,262 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2021-06-11 06:54:00,263 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:54:00,263 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 247 flow [2021-06-11 06:54:00,263 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 247 flow [2021-06-11 06:54:00,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 247 flow [2021-06-11 06:54:00,273 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-06-11 06:54:00,273 INFO L130 PetriNetUnfolder]: For 233/255 co-relation queries the response was YES. [2021-06-11 06:54:00,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 111 events. 31/111 cut-off events. For 233/255 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 5 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 404. Up to 64 conditions per place. [2021-06-11 06:54:00,274 INFO L151 LiptonReduction]: Number of co-enabled transitions 312 [2021-06-11 06:54:00,277 INFO L163 LiptonReduction]: Checked pairs total: 220 [2021-06-11 06:54:00,277 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:54:00,277 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 06:54:00,278 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 247 flow [2021-06-11 06:54:00,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:54:00,278 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:54:00,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:54:00,278 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:54:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:54:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1966607990, now seen corresponding path program 1 times [2021-06-11 06:54:00,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:54:00,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644671621] [2021-06-11 06:54:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:54:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:54:00,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,363 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:54:00,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:54:00,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:54:00,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644671621] [2021-06-11 06:54:00,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:54:00,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:54:00,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843866498] [2021-06-11 06:54:00,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:54:00,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:54:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:54:00,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:54:00,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 188 [2021-06-11 06:54:00,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:54:00,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 188 [2021-06-11 06:54:00,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:54:00,445 INFO L129 PetriNetUnfolder]: 24/92 cut-off events. [2021-06-11 06:54:00,445 INFO L130 PetriNetUnfolder]: For 297/396 co-relation queries the response was YES. [2021-06-11 06:54:00,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 92 events. 24/92 cut-off events. For 297/396 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 383 event pairs, 1 based on Foata normal form. 50/138 useless extension candidates. Maximal degree in co-relation 397. Up to 58 conditions per place. [2021-06-11 06:54:00,446 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 19 changer transitions 3/43 dead transitions. [2021-06-11 06:54:00,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 325 flow [2021-06-11 06:54:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:54:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:54:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1349 transitions. [2021-06-11 06:54:00,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7972813238770685 [2021-06-11 06:54:00,449 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1349 transitions. [2021-06-11 06:54:00,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1349 transitions. [2021-06-11 06:54:00,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:54:00,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1349 transitions. [2021-06-11 06:54:00,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.88888888888889) internal successors, (1349), 9 states have internal predecessors, (1349), 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-06-11 06:54:00,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 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-06-11 06:54:00,453 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 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-06-11 06:54:00,453 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 247 flow. Second operand 9 states and 1349 transitions. [2021-06-11 06:54:00,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 325 flow [2021-06-11 06:54:00,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 284 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-06-11 06:54:00,456 INFO L241 Difference]: Finished difference. Result has 57 places, 40 transitions, 267 flow [2021-06-11 06:54:00,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2021-06-11 06:54:00,456 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-06-11 06:54:00,456 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:54:00,456 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 40 transitions, 267 flow [2021-06-11 06:54:00,456 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 40 transitions, 267 flow [2021-06-11 06:54:00,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 40 transitions, 267 flow [2021-06-11 06:54:00,463 INFO L129 PetriNetUnfolder]: 22/91 cut-off events. [2021-06-11 06:54:00,463 INFO L130 PetriNetUnfolder]: For 209/216 co-relation queries the response was YES. [2021-06-11 06:54:00,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 91 events. 22/91 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 409 event pairs, 1 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 331. Up to 25 conditions per place. [2021-06-11 06:54:00,464 INFO L151 LiptonReduction]: Number of co-enabled transitions 284 [2021-06-11 06:54:00,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,495 INFO L163 LiptonReduction]: Checked pairs total: 409 [2021-06-11 06:54:00,495 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:54:00,495 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-06-11 06:54:00,495 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 265 flow [2021-06-11 06:54:00,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:54:00,496 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-06-11 06:54:00,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:54:00,496 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:54:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:54:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1678898872, now seen corresponding path program 1 times [2021-06-11 06:54:00,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:54:00,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285165723] [2021-06-11 06:54:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:54:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:54:00,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:54:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:54:00,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285165723] [2021-06-11 06:54:00,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:54:00,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:54:00,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230082343] [2021-06-11 06:54:00,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:54:00,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:54:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:54:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:54:00,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 189 [2021-06-11 06:54:00,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:54:00,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 189 [2021-06-11 06:54:00,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:54:00,557 INFO L129 PetriNetUnfolder]: 48/168 cut-off events. [2021-06-11 06:54:00,557 INFO L130 PetriNetUnfolder]: For 417/431 co-relation queries the response was YES. [2021-06-11 06:54:00,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 168 events. 48/168 cut-off events. For 417/431 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 973 event pairs, 1 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 646. Up to 55 conditions per place. [2021-06-11 06:54:00,558 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 3 selfloop transitions, 1 changer transitions 8/40 dead transitions. [2021-06-11 06:54:00,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 278 flow [2021-06-11 06:54:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:54:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:54:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-06-11 06:54:00,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8015873015873016 [2021-06-11 06:54:00,560 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-06-11 06:54:00,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-06-11 06:54:00,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:54:00,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-06-11 06:54:00,561 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-06-11 06:54:00,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,562 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,563 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 265 flow. Second operand 4 states and 606 transitions. [2021-06-11 06:54:00,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 278 flow [2021-06-11 06:54:00,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 218 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-11 06:54:00,565 INFO L241 Difference]: Finished difference. Result has 52 places, 32 transitions, 167 flow [2021-06-11 06:54:00,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2021-06-11 06:54:00,566 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2021-06-11 06:54:00,566 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:54:00,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 167 flow [2021-06-11 06:54:00,566 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 32 transitions, 167 flow [2021-06-11 06:54:00,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 167 flow [2021-06-11 06:54:00,571 INFO L129 PetriNetUnfolder]: 13/68 cut-off events. [2021-06-11 06:54:00,571 INFO L130 PetriNetUnfolder]: For 59/60 co-relation queries the response was YES. [2021-06-11 06:54:00,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 68 events. 13/68 cut-off events. For 59/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 264 event pairs, 1 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 186. Up to 23 conditions per place. [2021-06-11 06:54:00,572 INFO L151 LiptonReduction]: Number of co-enabled transitions 154 [2021-06-11 06:54:00,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:54:00,636 INFO L163 LiptonReduction]: Checked pairs total: 120 [2021-06-11 06:54:00,636 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:54:00,636 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 70 [2021-06-11 06:54:00,636 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 168 flow [2021-06-11 06:54:00,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:54:00,637 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:54:00,637 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:54:00,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:54:00,637 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:54:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:54:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1787028340, now seen corresponding path program 1 times [2021-06-11 06:54:00,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:54:00,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001918472] [2021-06-11 06:54:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:54:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:54:00,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:54:00,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:54:00,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 06:54:00,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:54:00,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:54:00,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:54:00,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:54:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:54:00,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001918472] [2021-06-11 06:54:00,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:54:00,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 06:54:00,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117909558] [2021-06-11 06:54:00,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 06:54:00,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:54:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 06:54:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-11 06:54:00,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 191 [2021-06-11 06:54:00,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-06-11 06:54:00,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:54:00,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 191 [2021-06-11 06:54:00,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:54:00,883 INFO L129 PetriNetUnfolder]: 25/116 cut-off events. [2021-06-11 06:54:00,883 INFO L130 PetriNetUnfolder]: For 187/222 co-relation queries the response was YES. [2021-06-11 06:54:00,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 116 events. 25/116 cut-off events. For 187/222 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 600 event pairs, 0 based on Foata normal form. 24/138 useless extension candidates. Maximal degree in co-relation 357. Up to 41 conditions per place. [2021-06-11 06:54:00,884 INFO L132 encePairwiseOnDemand]: 184/191 looper letters, 7 selfloop transitions, 7 changer transitions 3/37 dead transitions. [2021-06-11 06:54:00,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 233 flow [2021-06-11 06:54:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:54:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:54:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2021-06-11 06:54:00,887 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6788830715532286 [2021-06-11 06:54:00,887 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2021-06-11 06:54:00,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2021-06-11 06:54:00,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:54:00,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2021-06-11 06:54:00,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-06-11 06:54:00,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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-06-11 06:54:00,890 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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-06-11 06:54:00,890 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 168 flow. Second operand 6 states and 778 transitions. [2021-06-11 06:54:00,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 233 flow [2021-06-11 06:54:00,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 214 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-06-11 06:54:00,892 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 182 flow [2021-06-11 06:54:00,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2021-06-11 06:54:00,893 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2021-06-11 06:54:00,893 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:54:00,893 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 182 flow [2021-06-11 06:54:00,893 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 182 flow [2021-06-11 06:54:00,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 182 flow [2021-06-11 06:54:00,899 INFO L129 PetriNetUnfolder]: 15/75 cut-off events. [2021-06-11 06:54:00,899 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-06-11 06:54:00,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 75 events. 15/75 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 307 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 226. Up to 27 conditions per place. [2021-06-11 06:54:00,899 INFO L151 LiptonReduction]: Number of co-enabled transitions 120 [2021-06-11 06:54:00,901 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:54:00,901 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:54:00,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-06-11 06:54:00,901 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 182 flow [2021-06-11 06:54:00,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-06-11 06:54:00,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:54:00,903 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:54:00,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:54:00,903 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:54:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:54:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1605350594, now seen corresponding path program 1 times [2021-06-11 06:54:00,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:54:00,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83952438] [2021-06-11 06:54:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:54:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:54:00,927 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:54:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:54:00,956 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:54:00,993 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:54:00,993 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:54:00,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:54:01,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:54:01 BasicIcfg [2021-06-11 06:54:01,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:54:01,050 INFO L168 Benchmark]: Toolchain (without parser) took 17085.99 ms. Allocated memory was 375.4 MB in the beginning and 654.3 MB in the end (delta: 278.9 MB). Free memory was 338.9 MB in the beginning and 427.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 192.9 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,050 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 375.4 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:54:01,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.05 ms. Allocated memory is still 375.4 MB. Free memory was 338.7 MB in the beginning and 336.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.20 ms. Allocated memory is still 375.4 MB. Free memory was 336.2 MB in the beginning and 333.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,051 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 ms. Allocated memory is still 375.4 MB. Free memory was 333.0 MB in the beginning and 330.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,051 INFO L168 Benchmark]: RCFGBuilder took 1423.03 ms. Allocated memory is still 375.4 MB. Free memory was 330.9 MB in the beginning and 290.9 MB in the end (delta: 40.0 MB). Peak memory consumption was 166.9 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,051 INFO L168 Benchmark]: TraceAbstraction took 15192.58 ms. Allocated memory was 375.4 MB in the beginning and 654.3 MB in the end (delta: 278.9 MB). Free memory was 289.9 MB in the beginning and 427.2 MB in the end (delta: -137.4 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. [2021-06-11 06:54:01,052 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.09 ms. Allocated memory is still 375.4 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 406.05 ms. Allocated memory is still 375.4 MB. Free memory was 338.7 MB in the beginning and 336.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.20 ms. Allocated memory is still 375.4 MB. Free memory was 336.2 MB in the beginning and 333.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.54 ms. Allocated memory is still 375.4 MB. Free memory was 333.0 MB in the beginning and 330.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1423.03 ms. Allocated memory is still 375.4 MB. Free memory was 330.9 MB in the beginning and 290.9 MB in the end (delta: 40.0 MB). Peak memory consumption was 166.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15192.58 ms. Allocated memory was 375.4 MB in the beginning and 654.3 MB in the end (delta: 278.9 MB). Free memory was 289.9 MB in the beginning and 427.2 MB in the end (delta: -137.4 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13138.5ms, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 28 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 5335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2469, positive: 2296, positive conditional: 0, positive unconditional: 2296, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1246, positive: 1190, positive conditional: 0, positive unconditional: 1190, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1246, positive: 1190, positive conditional: 0, positive unconditional: 1190, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1246, positive: 1174, positive conditional: 0, positive unconditional: 1174, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 729, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 702, negative conditional: 0, negative unconditional: 702, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2469, positive: 1106, positive conditional: 0, positive unconditional: 1106, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 2233, Positive cache size: 2177, Positive conditional cache size: 0, Positive unconditional cache size: 2177, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1ms, 33 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 80, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2241, Positive cache size: 2185, Positive conditional cache size: 0, Positive unconditional cache size: 2185, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0ms, 33 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 248 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 88, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2250, Positive cache size: 2194, Positive conditional cache size: 0, Positive unconditional cache size: 2194, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.9ms, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 383 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 146, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 2333, Positive cache size: 2273, Positive conditional cache size: 0, Positive unconditional cache size: 2273, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 10, negative conditional: 0, negative unconditional: 10, 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: 58, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2333, Positive cache size: 2273, Positive conditional cache size: 0, Positive unconditional cache size: 2273, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2335, Positive cache size: 2274, Positive conditional cache size: 0, Positive unconditional cache size: 2274, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.9ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 10, negative conditional: 0, negative unconditional: 10, 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: 65, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2335, Positive cache size: 2274, Positive conditional cache size: 0, Positive unconditional cache size: 2274, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.4ms, 57 PlacesBefore, 55 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 409 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 158, positive conditional: 0, positive unconditional: 158, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 157, positive conditional: 0, positive unconditional: 157, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2395, Positive cache size: 2332, Positive conditional cache size: 0, Positive unconditional cache size: 2332, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.1ms, 52 PlacesBefore, 48 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2554, Positive cache size: 2490, Positive conditional cache size: 0, Positive unconditional cache size: 2490, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0ms, 49 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2554, Positive cache size: 2490, Positive conditional cache size: 0, Positive unconditional cache size: 2490, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2290; [L821] FCALL, FORK 0 pthread_create(&t2290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2291; [L823] FCALL, FORK 0 pthread_create(&t2291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2292; [L825] FCALL, FORK 0 pthread_create(&t2292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15069.4ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 604.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13188.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 17 SDslu, 14 SDs, 0 SdLazy, 172 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 177.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 194.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=7, InterpolantAutomatonStates: 45, 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: 24.9ms SsaConstructionTime, 263.2ms SatisfiabilityAnalysisTime, 432.1ms InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...