/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:51:54,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:51:54,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:51:54,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:51:54,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:51:54,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:51:54,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:51:54,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:51:54,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:51:54,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:51:54,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:51:54,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:51:54,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:51:54,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:51:54,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:51:54,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:51:54,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:51:54,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:51:54,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:51:54,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:51:54,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:51:54,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:51:54,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:51:54,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:51:54,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:51:54,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:51:54,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:51:54,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:51:54,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:51:54,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:51:54,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:51:54,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:51:54,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:51:54,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:51:54,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:51:54,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:51:54,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:51:54,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:51:54,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:51:54,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:51:54,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:51:54,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:51:54,990 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:51:54,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:51:54,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:51:54,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:51:54,995 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:51:54,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:51:54,995 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:51:54,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:51:54,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:51:54,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:51:54,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:51:54,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:51:54,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:51:54,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:51:54,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:51:54,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:51:54,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:51:54,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:51:54,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:51:54,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:51:54,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:51:54,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:51:54,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:51:54,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:51:54,999 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:51:55,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:51:55,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:51:55,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:51:55,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:51:55,295 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:51:55,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-25 04:51:55,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5fc9a2/4dd40f27087745b58c1d822c11fa6822/FLAG3ce6590be [2021-03-25 04:51:55,873 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:51:55,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-25 04:51:55,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5fc9a2/4dd40f27087745b58c1d822c11fa6822/FLAG3ce6590be [2021-03-25 04:51:56,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5fc9a2/4dd40f27087745b58c1d822c11fa6822 [2021-03-25 04:51:56,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:51:56,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:51:56,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:51:56,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:51:56,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:51:56,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:56,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d35579d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56, skipping insertion in model container [2021-03-25 04:51:56,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:56,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:51:56,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:51:56,565 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/rfi000_pso.opt.i[948,961] [2021-03-25 04:51:56,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:51:56,797 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:51:56,809 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/rfi000_pso.opt.i[948,961] [2021-03-25 04:51:56,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:51:56,931 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:51:56,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56 WrapperNode [2021-03-25 04:51:56,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:51:56,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:51:56,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:51:56,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:51:56,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:56,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:51:57,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:51:57,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:51:57,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:51:57,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... [2021-03-25 04:51:57,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:51:57,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:51:57,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:51:57,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:51:57,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:51:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:51:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:51:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:51:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:51:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:51:57,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:51:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:51:57,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:51:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:51:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:51:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:51:57,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:51:57,157 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:51:58,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:51:58,841 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:51:58,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:51:58 BoogieIcfgContainer [2021-03-25 04:51:58,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:51:58,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:51:58,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:51:58,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:51:58,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:51:56" (1/3) ... [2021-03-25 04:51:58,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e9741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:51:58, skipping insertion in model container [2021-03-25 04:51:58,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:56" (2/3) ... [2021-03-25 04:51:58,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e9741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:51:58, skipping insertion in model container [2021-03-25 04:51:58,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:51:58" (3/3) ... [2021-03-25 04:51:58,850 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-03-25 04:51:58,858 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:51:58,861 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:51:58,862 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:51:58,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,923 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,923 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,923 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:58,935 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:51:58,951 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 04:51:58,969 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:51:58,969 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:51:58,969 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:51:58,969 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:51:58,969 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:51:58,969 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:51:58,970 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:51:58,970 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:51:58,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-25 04:51:59,006 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-25 04:51:59,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:59,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 04:51:59,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-25 04:51:59,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-25 04:51:59,014 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:59,022 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-25 04:51:59,024 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-25 04:51:59,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-25 04:51:59,041 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-25 04:51:59,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:59,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 04:51:59,043 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 04:51:59,968 WARN L205 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 04:52:00,265 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:52:01,660 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 04:52:02,280 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:52:02,902 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:52:03,308 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:52:03,449 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:52:04,636 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 04:52:04,939 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:52:05,536 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:52:06,143 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:52:06,158 INFO L154 LiptonReduction]: Checked pairs total: 1826 [2021-03-25 04:52:06,158 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 04:52:06,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7147 [2021-03-25 04:52:06,167 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 04:52:06,167 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:52:06,167 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:06,168 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:06,168 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash -481716019, now seen corresponding path program 1 times [2021-03-25 04:52:06,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:06,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054573989] [2021-03-25 04:52:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:06,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:06,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:06,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:06,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:06,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054573989] [2021-03-25 04:52:06,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:06,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:52:06,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752575384] [2021-03-25 04:52:06,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:52:06,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:52:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:52:06,431 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 140 [2021-03-25 04:52:06,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:06,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:06,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 140 [2021-03-25 04:52:06,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:06,508 INFO L129 PetriNetUnfolder]: 23/95 cut-off events. [2021-03-25 04:52:06,508 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:52:06,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 95 events. 23/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 9 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 134. Up to 37 conditions per place. [2021-03-25 04:52:06,511 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2021-03-25 04:52:06,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 96 flow [2021-03-25 04:52:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:52:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:52:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2021-03-25 04:52:06,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2021-03-25 04:52:06,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2021-03-25 04:52:06,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2021-03-25 04:52:06,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:06,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2021-03-25 04:52:06,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:06,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:06,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:06,545 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 368 transitions. [2021-03-25 04:52:06,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 96 flow [2021-03-25 04:52:06,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:06,549 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 60 flow [2021-03-25 04:52:06,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-25 04:52:06,552 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-25 04:52:06,552 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:06,553 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 60 flow [2021-03-25 04:52:06,554 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 60 flow [2021-03-25 04:52:06,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 60 flow [2021-03-25 04:52:06,559 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 04:52:06,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:52:06,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:52:06,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-25 04:52:07,527 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-25 04:52:07,847 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:52:08,442 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:52:09,072 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:52:09,370 INFO L154 LiptonReduction]: Checked pairs total: 592 [2021-03-25 04:52:09,370 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:52:09,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2818 [2021-03-25 04:52:09,371 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 48 flow [2021-03-25 04:52:09,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:09,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:09,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:09,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:52:09,372 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1314646513, now seen corresponding path program 1 times [2021-03-25 04:52:09,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:09,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329387675] [2021-03-25 04:52:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:09,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:09,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:09,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:09,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:09,478 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:52:09,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:52:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:09,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329387675] [2021-03-25 04:52:09,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:09,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:09,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776022391] [2021-03-25 04:52:09,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:52:09,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:52:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:52:09,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146 [2021-03-25 04:52:09,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:09,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:09,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146 [2021-03-25 04:52:09,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:09,500 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 04:52:09,500 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:52:09,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:52:09,501 INFO L132 encePairwiseOnDemand]: 143/146 looper letters, 1 selfloop transitions, 2 changer transitions 1/20 dead transitions. [2021-03-25 04:52:09,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 54 flow [2021-03-25 04:52:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:52:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:52:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2021-03-25 04:52:09,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515981735159818 [2021-03-25 04:52:09,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2021-03-25 04:52:09,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2021-03-25 04:52:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:09,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2021-03-25 04:52:09,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:09,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:09,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:09,506 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 48 flow. Second operand 3 states and 373 transitions. [2021-03-25 04:52:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 54 flow [2021-03-25 04:52:09,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:09,507 INFO L241 Difference]: Finished difference. Result has 28 places, 19 transitions, 50 flow [2021-03-25 04:52:09,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2021-03-25 04:52:09,508 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-25 04:52:09,508 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:09,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 50 flow [2021-03-25 04:52:09,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 50 flow [2021-03-25 04:52:09,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 19 transitions, 50 flow [2021-03-25 04:52:09,511 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 04:52:09,511 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:52:09,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:52:09,511 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 04:52:09,874 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 04:52:09,989 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 04:52:10,254 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 04:52:10,366 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 04:52:10,368 INFO L154 LiptonReduction]: Checked pairs total: 465 [2021-03-25 04:52:10,368 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:52:10,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 860 [2021-03-25 04:52:10,369 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 46 flow [2021-03-25 04:52:10,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:10,369 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:10,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:52:10,369 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1307109435, now seen corresponding path program 1 times [2021-03-25 04:52:10,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:10,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222623911] [2021-03-25 04:52:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:10,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:10,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222623911] [2021-03-25 04:52:10,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:10,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:52:10,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791278271] [2021-03-25 04:52:10,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:52:10,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:52:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:52:10,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 148 [2021-03-25 04:52:10,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:10,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 148 [2021-03-25 04:52:10,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:10,439 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:52:10,439 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 04:52:10,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:52:10,439 INFO L132 encePairwiseOnDemand]: 145/148 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-25 04:52:10,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 17 transitions, 52 flow [2021-03-25 04:52:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:52:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:52:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2021-03-25 04:52:10,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8738738738738738 [2021-03-25 04:52:10,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2021-03-25 04:52:10,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2021-03-25 04:52:10,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:10,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2021-03-25 04:52:10,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,444 INFO L185 Difference]: Start difference. First operand has 25 places, 17 transitions, 46 flow. Second operand 3 states and 388 transitions. [2021-03-25 04:52:10,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 17 transitions, 52 flow [2021-03-25 04:52:10,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 48 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:10,445 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2021-03-25 04:52:10,445 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2021-03-25 04:52:10,445 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:10,445 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,445 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,448 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:52:10,448 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:52:10,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 17 events. 0/17 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:52:10,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 116 [2021-03-25 04:52:10,449 INFO L154 LiptonReduction]: Checked pairs total: 153 [2021-03-25 04:52:10,450 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:52:10,450 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 04:52:10,450 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:10,451 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:10,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:52:10,451 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 969605538, now seen corresponding path program 1 times [2021-03-25 04:52:10,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:10,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805341183] [2021-03-25 04:52:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:10,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:10,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:10,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805341183] [2021-03-25 04:52:10,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:10,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:52:10,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243758431] [2021-03-25 04:52:10,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:52:10,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:52:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:52:10,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 148 [2021-03-25 04:52:10,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:10,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 148 [2021-03-25 04:52:10,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:10,586 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-25 04:52:10,586 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 04:52:10,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 36 events. 2/36 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 60. Up to 9 conditions per place. [2021-03-25 04:52:10,587 INFO L132 encePairwiseOnDemand]: 145/148 looper letters, 6 selfloop transitions, 2 changer transitions 1/20 dead transitions. [2021-03-25 04:52:10,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 78 flow [2021-03-25 04:52:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:52:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:52:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2021-03-25 04:52:10,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2021-03-25 04:52:10,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2021-03-25 04:52:10,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2021-03-25 04:52:10,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:10,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2021-03-25 04:52:10,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,591 INFO L185 Difference]: Start difference. First operand has 26 places, 17 transitions, 50 flow. Second operand 3 states and 382 transitions. [2021-03-25 04:52:10,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 78 flow [2021-03-25 04:52:10,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 67 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 04:52:10,592 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2021-03-25 04:52:10,592 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2021-03-25 04:52:10,593 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:10,593 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,593 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 50 flow [2021-03-25 04:52:10,596 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:52:10,596 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 04:52:10,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:52:10,596 INFO L142 LiptonReduction]: Number of co-enabled transitions 82 [2021-03-25 04:52:10,729 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-25 04:52:10,729 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:52:10,729 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-25 04:52:10,730 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 48 flow [2021-03-25 04:52:10,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:10,730 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:10,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:52:10,731 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1459105774, now seen corresponding path program 1 times [2021-03-25 04:52:10,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:10,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314807795] [2021-03-25 04:52:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:10,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:52:10,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:52:10,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:52:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:10,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314807795] [2021-03-25 04:52:10,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:10,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:10,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967116221] [2021-03-25 04:52:10,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:52:10,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:52:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:52:10,818 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2021-03-25 04:52:10,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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-03-25 04:52:10,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:10,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2021-03-25 04:52:10,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:10,872 INFO L129 PetriNetUnfolder]: 15/49 cut-off events. [2021-03-25 04:52:10,872 INFO L130 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2021-03-25 04:52:10,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 49 events. 15/49 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 6 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 97. Up to 30 conditions per place. [2021-03-25 04:52:10,873 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 7 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2021-03-25 04:52:10,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 78 flow [2021-03-25 04:52:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:52:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:52:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2021-03-25 04:52:10,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7449664429530202 [2021-03-25 04:52:10,876 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2021-03-25 04:52:10,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2021-03-25 04:52:10,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:10,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2021-03-25 04:52:10,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,879 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,879 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 48 flow. Second operand 4 states and 444 transitions. [2021-03-25 04:52:10,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 78 flow [2021-03-25 04:52:10,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:10,880 INFO L241 Difference]: Finished difference. Result has 27 places, 18 transitions, 65 flow [2021-03-25 04:52:10,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2021-03-25 04:52:10,880 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -12 predicate places. [2021-03-25 04:52:10,880 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:10,880 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 65 flow [2021-03-25 04:52:10,881 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 65 flow [2021-03-25 04:52:10,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 65 flow [2021-03-25 04:52:10,885 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2021-03-25 04:52:10,885 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 04:52:10,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-25 04:52:10,885 INFO L142 LiptonReduction]: Number of co-enabled transitions 80 [2021-03-25 04:52:10,886 INFO L154 LiptonReduction]: Checked pairs total: 87 [2021-03-25 04:52:10,886 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:52:10,886 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 04:52:10,887 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 65 flow [2021-03-25 04:52:10,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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-03-25 04:52:10,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:10,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:10,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:52:10,888 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 637330910, now seen corresponding path program 1 times [2021-03-25 04:52:10,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:10,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88681446] [2021-03-25 04:52:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:10,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:10,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:10,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:10,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:10,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88681446] [2021-03-25 04:52:10,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:10,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:10,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796724815] [2021-03-25 04:52:10,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:52:10,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:10,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:52:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:52:10,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 149 [2021-03-25 04:52:10,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:10,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 149 [2021-03-25 04:52:10,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:10,980 INFO L129 PetriNetUnfolder]: 5/39 cut-off events. [2021-03-25 04:52:10,980 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2021-03-25 04:52:10,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 39 events. 5/39 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 1 based on Foata normal form. 4/43 useless extension candidates. Maximal degree in co-relation 84. Up to 15 conditions per place. [2021-03-25 04:52:10,981 INFO L132 encePairwiseOnDemand]: 146/149 looper letters, 6 selfloop transitions, 1 changer transitions 2/21 dead transitions. [2021-03-25 04:52:10,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 21 transitions, 91 flow [2021-03-25 04:52:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:52:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:52:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2021-03-25 04:52:10,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8087248322147651 [2021-03-25 04:52:10,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2021-03-25 04:52:10,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2021-03-25 04:52:10,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:10,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2021-03-25 04:52:10,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,989 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:10,989 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 65 flow. Second operand 4 states and 482 transitions. [2021-03-25 04:52:10,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 21 transitions, 91 flow [2021-03-25 04:52:10,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:10,991 INFO L241 Difference]: Finished difference. Result has 30 places, 18 transitions, 67 flow [2021-03-25 04:52:10,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2021-03-25 04:52:10,991 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2021-03-25 04:52:10,991 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:10,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 67 flow [2021-03-25 04:52:10,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 67 flow [2021-03-25 04:52:10,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 67 flow [2021-03-25 04:52:10,996 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 04:52:10,996 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-25 04:52:10,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 28 events. 3/28 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2021-03-25 04:52:10,996 INFO L142 LiptonReduction]: Number of co-enabled transitions 72 [2021-03-25 04:52:11,139 INFO L154 LiptonReduction]: Checked pairs total: 143 [2021-03-25 04:52:11,139 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:52:11,139 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 148 [2021-03-25 04:52:11,142 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 65 flow [2021-03-25 04:52:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:11,142 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:11,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:52:11,143 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 714840296, now seen corresponding path program 2 times [2021-03-25 04:52:11,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:11,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353992918] [2021-03-25 04:52:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:11,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:11,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:52:11,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:52:11,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:52:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:11,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353992918] [2021-03-25 04:52:11,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:11,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:11,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187541680] [2021-03-25 04:52:11,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:52:11,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:11,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:52:11,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:52:11,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 150 [2021-03-25 04:52:11,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:11,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 150 [2021-03-25 04:52:11,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:11,306 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-03-25 04:52:11,306 INFO L130 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2021-03-25 04:52:11,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 51 events. 14/51 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 6 based on Foata normal form. 2/52 useless extension candidates. Maximal degree in co-relation 125. Up to 28 conditions per place. [2021-03-25 04:52:11,307 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 7 selfloop transitions, 5 changer transitions 0/20 dead transitions. [2021-03-25 04:52:11,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 97 flow [2021-03-25 04:52:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:52:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:52:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2021-03-25 04:52:11,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7983333333333333 [2021-03-25 04:52:11,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2021-03-25 04:52:11,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2021-03-25 04:52:11,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:11,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2021-03-25 04:52:11,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,313 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,313 INFO L185 Difference]: Start difference. First operand has 28 places, 17 transitions, 65 flow. Second operand 4 states and 479 transitions. [2021-03-25 04:52:11,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 97 flow [2021-03-25 04:52:11,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 91 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 04:52:11,314 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 85 flow [2021-03-25 04:52:11,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2021-03-25 04:52:11,315 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2021-03-25 04:52:11,315 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:11,315 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 85 flow [2021-03-25 04:52:11,315 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 85 flow [2021-03-25 04:52:11,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 85 flow [2021-03-25 04:52:11,320 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-25 04:52:11,321 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-03-25 04:52:11,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 30 events. 5/30 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 73. Up to 13 conditions per place. [2021-03-25 04:52:11,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 04:52:11,322 INFO L154 LiptonReduction]: Checked pairs total: 77 [2021-03-25 04:52:11,322 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:52:11,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:52:11,323 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 85 flow [2021-03-25 04:52:11,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:11,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:11,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:52:11,324 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1003838125, now seen corresponding path program 1 times [2021-03-25 04:52:11,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:11,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520124195] [2021-03-25 04:52:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:11,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:11,363 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:52:11,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:52:11,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:11,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520124195] [2021-03-25 04:52:11,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:11,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:11,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457912028] [2021-03-25 04:52:11,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:52:11,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:52:11,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:52:11,372 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 150 [2021-03-25 04:52:11,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:11,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 150 [2021-03-25 04:52:11,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:11,402 INFO L129 PetriNetUnfolder]: 11/52 cut-off events. [2021-03-25 04:52:11,402 INFO L130 PetriNetUnfolder]: For 40/41 co-relation queries the response was YES. [2021-03-25 04:52:11,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 52 events. 11/52 cut-off events. For 40/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 3 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 127. Up to 22 conditions per place. [2021-03-25 04:52:11,403 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 4 selfloop transitions, 6 changer transitions 2/26 dead transitions. [2021-03-25 04:52:11,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 123 flow [2021-03-25 04:52:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:52:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:52:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2021-03-25 04:52:11,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8186666666666667 [2021-03-25 04:52:11,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2021-03-25 04:52:11,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2021-03-25 04:52:11,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:11,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2021-03-25 04:52:11,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,409 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,410 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 85 flow. Second operand 5 states and 614 transitions. [2021-03-25 04:52:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 123 flow [2021-03-25 04:52:11,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 115 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:11,411 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2021-03-25 04:52:11,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-25 04:52:11,412 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2021-03-25 04:52:11,412 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:11,412 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 118 flow [2021-03-25 04:52:11,412 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 118 flow [2021-03-25 04:52:11,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 118 flow [2021-03-25 04:52:11,419 INFO L129 PetriNetUnfolder]: 6/44 cut-off events. [2021-03-25 04:52:11,419 INFO L130 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2021-03-25 04:52:11,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 44 events. 6/44 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 131 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 119. Up to 14 conditions per place. [2021-03-25 04:52:11,420 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 04:52:11,423 INFO L154 LiptonReduction]: Checked pairs total: 47 [2021-03-25 04:52:11,423 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:52:11,423 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-25 04:52:11,424 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2021-03-25 04:52:11,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:11,424 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:11,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:52:11,424 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -889566375, now seen corresponding path program 1 times [2021-03-25 04:52:11,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:11,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465506680] [2021-03-25 04:52:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:11,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:11,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:11,524 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:52:11,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:52:11,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:11,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:11,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-03-25 04:52:11,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465506680] [2021-03-25 04:52:11,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:11,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:52:11,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851631994] [2021-03-25 04:52:11,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:52:11,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:52:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:52:11,535 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 150 [2021-03-25 04:52:11,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:11,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 150 [2021-03-25 04:52:11,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:11,584 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-03-25 04:52:11,584 INFO L130 PetriNetUnfolder]: For 41/56 co-relation queries the response was YES. [2021-03-25 04:52:11,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 35 events. 4/35 cut-off events. For 41/56 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 0 based on Foata normal form. 20/55 useless extension candidates. Maximal degree in co-relation 103. Up to 11 conditions per place. [2021-03-25 04:52:11,584 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 2 selfloop transitions, 8 changer transitions 3/27 dead transitions. [2021-03-25 04:52:11,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 156 flow [2021-03-25 04:52:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:52:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:52:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2021-03-25 04:52:11,587 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2021-03-25 04:52:11,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2021-03-25 04:52:11,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2021-03-25 04:52:11,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:11,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2021-03-25 04:52:11,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,595 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:11,595 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 7 states and 855 transitions. [2021-03-25 04:52:11,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 156 flow [2021-03-25 04:52:11,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 144 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 04:52:11,599 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 133 flow [2021-03-25 04:52:11,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-03-25 04:52:11,600 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2021-03-25 04:52:11,600 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:11,600 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 133 flow [2021-03-25 04:52:11,600 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 133 flow [2021-03-25 04:52:11,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 133 flow [2021-03-25 04:52:11,604 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-25 04:52:11,604 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-03-25 04:52:11,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 32 events. 3/32 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 94. Up to 11 conditions per place. [2021-03-25 04:52:11,607 INFO L142 LiptonReduction]: Number of co-enabled transitions 60 [2021-03-25 04:52:11,875 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:52:11,996 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:52:12,642 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 193 [2021-03-25 04:52:12,841 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-25 04:52:14,090 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 348 DAG size of output: 269 [2021-03-25 04:52:14,588 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 04:52:14,591 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-25 04:52:14,591 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:52:14,591 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2991 [2021-03-25 04:52:14,591 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 113 flow [2021-03-25 04:52:14,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:14,592 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:14,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:52:14,592 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1486157812, now seen corresponding path program 1 times [2021-03-25 04:52:14,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:14,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315423206] [2021-03-25 04:52:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:52:14,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:14,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:52:14,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:14,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:14,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:52:14,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:52:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:52:14,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315423206] [2021-03-25 04:52:14,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:52:14,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:52:14,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565488570] [2021-03-25 04:52:14,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:52:14,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:52:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:52:14,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:52:14,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 152 [2021-03-25 04:52:14,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:52:14,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 152 [2021-03-25 04:52:14,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:52:14,664 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-03-25 04:52:14,664 INFO L130 PetriNetUnfolder]: For 74/75 co-relation queries the response was YES. [2021-03-25 04:52:14,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 38 events. 6/38 cut-off events. For 74/75 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 102 event pairs, 0 based on Foata normal form. 2/40 useless extension candidates. Maximal degree in co-relation 112. Up to 13 conditions per place. [2021-03-25 04:52:14,665 INFO L132 encePairwiseOnDemand]: 149/152 looper letters, 4 selfloop transitions, 1 changer transitions 1/20 dead transitions. [2021-03-25 04:52:14,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 20 transitions, 118 flow [2021-03-25 04:52:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:52:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:52:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2021-03-25 04:52:14,667 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7944078947368421 [2021-03-25 04:52:14,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2021-03-25 04:52:14,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2021-03-25 04:52:14,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:52:14,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2021-03-25 04:52:14,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,672 INFO L185 Difference]: Start difference. First operand has 38 places, 20 transitions, 113 flow. Second operand 4 states and 483 transitions. [2021-03-25 04:52:14,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 20 transitions, 118 flow [2021-03-25 04:52:14,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 97 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-25 04:52:14,674 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 90 flow [2021-03-25 04:52:14,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2021-03-25 04:52:14,675 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2021-03-25 04:52:14,675 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:52:14,675 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 90 flow [2021-03-25 04:52:14,675 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 90 flow [2021-03-25 04:52:14,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 90 flow [2021-03-25 04:52:14,679 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-03-25 04:52:14,679 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-25 04:52:14,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 26 events. 3/26 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 62. Up to 7 conditions per place. [2021-03-25 04:52:14,679 INFO L142 LiptonReduction]: Number of co-enabled transitions 12 [2021-03-25 04:52:14,895 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 04:52:14,896 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:52:14,896 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 221 [2021-03-25 04:52:14,896 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 90 flow [2021-03-25 04:52:14,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:52:14,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:52:14,897 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:52:14,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:52:14,897 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:52:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:52:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1189362717, now seen corresponding path program 1 times [2021-03-25 04:52:14,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:52:14,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412572247] [2021-03-25 04:52:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:52:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:52:14,934 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:52:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:52:14,978 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:52:15,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:52:15,018 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:52:15,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:52:15,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:52:15 BasicIcfg [2021-03-25 04:52:15,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:52:15,091 INFO L168 Benchmark]: Toolchain (without parser) took 18717.39 ms. Allocated memory was 255.9 MB in the beginning and 597.7 MB in the end (delta: 341.8 MB). Free memory was 232.6 MB in the beginning and 463.0 MB in the end (delta: -230.4 MB). Peak memory consumption was 110.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,091 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:52:15,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.95 ms. Allocated memory was 255.9 MB in the beginning and 404.8 MB in the end (delta: 148.9 MB). Free memory was 232.1 MB in the beginning and 364.7 MB in the end (delta: -132.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.60 ms. Allocated memory is still 404.8 MB. Free memory was 364.7 MB in the beginning and 362.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,092 INFO L168 Benchmark]: Boogie Preprocessor took 53.64 ms. Allocated memory is still 404.8 MB. Free memory was 362.0 MB in the beginning and 359.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,092 INFO L168 Benchmark]: RCFGBuilder took 1773.26 ms. Allocated memory is still 404.8 MB. Free memory was 359.9 MB in the beginning and 311.8 MB in the end (delta: 48.1 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,092 INFO L168 Benchmark]: TraceAbstraction took 16245.75 ms. Allocated memory was 404.8 MB in the beginning and 597.7 MB in the end (delta: 192.9 MB). Free memory was 311.8 MB in the beginning and 463.0 MB in the end (delta: -151.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:52:15,094 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.51 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 558.95 ms. Allocated memory was 255.9 MB in the beginning and 404.8 MB in the end (delta: 148.9 MB). Free memory was 232.1 MB in the beginning and 364.7 MB in the end (delta: -132.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.60 ms. Allocated memory is still 404.8 MB. Free memory was 364.7 MB in the beginning and 362.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.64 ms. Allocated memory is still 404.8 MB. Free memory was 362.0 MB in the beginning and 359.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1773.26 ms. Allocated memory is still 404.8 MB. Free memory was 359.9 MB in the beginning and 311.8 MB in the end (delta: 48.1 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16245.75 ms. Allocated memory was 404.8 MB in the beginning and 597.7 MB in the end (delta: 192.9 MB). Free memory was 311.8 MB in the beginning and 463.0 MB in the end (delta: -151.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7134.2ms, 86 PlacesBefore, 39 PlacesAfterwards, 81 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 973, positive: 910, positive conditional: 0, positive unconditional: 910, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 518, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 973, positive: 414, positive conditional: 0, positive unconditional: 414, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 518, unknown conditional: 0, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2816.3ms, 37 PlacesBefore, 27 PlacesAfterwards, 26 TransitionsBefore, 20 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 592 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 157, positive conditional: 0, positive unconditional: 157, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 216, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 859.7ms, 28 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1ms, 26 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 153 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 62, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 136.1ms, 26 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 29, negative conditional: 0, negative unconditional: 29, 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: 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] , Cache Queries: [ total: 86, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8ms, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 87 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.3ms, 30 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 143 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 51, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2ms, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, 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: 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: 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] , Cache Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 47 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2991.1ms, 41 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 220.4ms, 32 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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] , Cache Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1591; [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 0 pthread_t t1592; [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L744] 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) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] 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) [L744] 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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 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 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 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; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] 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) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 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 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 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) [L820] 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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] 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)) [L823] 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)) [L823] 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)) [L824] 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)) [L824] 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)) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16052.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 505.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7194.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 16 SDslu, 12 SDs, 0 SdLazy, 111 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 144.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 120.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, InterpolantAutomatonStates: 40, 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: 42.2ms SsaConstructionTime, 333.0ms SatisfiabilityAnalysisTime, 522.7ms InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...