/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:51:55,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:51:55,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:51:55,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:51:55,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:51:55,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:51:55,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:51:55,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:51:55,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:51:55,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:51:55,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:51:55,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:51:55,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:51:55,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:51:55,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:51:55,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:51:55,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:51:55,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:51:55,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:51:55,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:51:55,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:51:55,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:51:55,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:51:55,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:51:55,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:51:55,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:51:55,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:51:55,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:51:55,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:51:55,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:51:55,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:51:55,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:51:55,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:51:55,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:51:55,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:51:55,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:51:55,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:51:55,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:51:55,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:51:55,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:51:55,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:51:55,256 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:51:55,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:51:55,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:51:55,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:51:55,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:51:55,286 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:51:55,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:51:55,287 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:51:55,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:51:55,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:51:55,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:51:55,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:51:55,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:51:55,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:51:55,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:51:55,289 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 15:51:55,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:51:55,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:51:55,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:51:55,512 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:51:55,513 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:51:55,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-06-11 15:51:55,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d515dfb64/1878a5b3dd6a4d8bb8b8c6d24f492941/FLAG1bed85a59 [2021-06-11 15:51:55,929 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:51:55,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-06-11 15:51:55,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d515dfb64/1878a5b3dd6a4d8bb8b8c6d24f492941/FLAG1bed85a59 [2021-06-11 15:51:56,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d515dfb64/1878a5b3dd6a4d8bb8b8c6d24f492941 [2021-06-11 15:51:56,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:51:56,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:51:56,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:51:56,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:51:56,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:51:56,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c7ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56, skipping insertion in model container [2021-06-11 15:51:56,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:51:56,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:51:56,503 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/mix054_pso.opt.i[948,961] [2021-06-11 15:51:56,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:51:56,647 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:51:56,654 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/mix054_pso.opt.i[948,961] [2021-06-11 15:51:56,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:51:56,731 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:51:56,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56 WrapperNode [2021-06-11 15:51:56,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:51:56,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:51:56,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:51:56,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:51:56,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:51:56,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:51:56,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:51:56,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:51:56,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (1/1) ... [2021-06-11 15:51:56,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:51:56,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:51:56,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:51:56,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:51:56,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03: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-06-11 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:51:56,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:51:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:51:56,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:51:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:51:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:51:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:51:56,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:51:56,848 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:51:58,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:51:58,014 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:51:58,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:51:58 BoogieIcfgContainer [2021-06-11 15:51:58,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:51:58,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:51:58,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:51:58,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:51:58,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:51:56" (1/3) ... [2021-06-11 15:51:58,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a9b46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:51:58, skipping insertion in model container [2021-06-11 15:51:58,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:56" (2/3) ... [2021-06-11 15:51:58,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a9b46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:51:58, skipping insertion in model container [2021-06-11 15:51:58,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:51:58" (3/3) ... [2021-06-11 15:51:58,022 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2021-06-11 15:51:58,027 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:51:58,030 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:51:58,031 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:51:58,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:58,066 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:51:58,077 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 15:51:58,097 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:51:58,097 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:51:58,097 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:51:58,097 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:51:58,097 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:51:58,097 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:51:58,097 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:51:58,097 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:51:58,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-06-11 15:51:58,135 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-11 15:51:58,135 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:58,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 15:51:58,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-06-11 15:51:58,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-06-11 15:51:58,149 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:58,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-06-11 15:51:58,163 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-06-11 15:51:58,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-06-11 15:51:58,180 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-11 15:51:58,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:58,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 15:51:58,182 INFO L151 LiptonReduction]: Number of co-enabled transitions 918 [2021-06-11 15:51:58,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:58,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:58,888 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-06-11 15:51:59,160 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 15:52:00,370 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-06-11 15:52:00,916 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 15:52:00,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:00,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:00,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:00,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:00,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:00,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:00,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:00,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:00,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:00,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,311 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:52:01,311 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:52:01,333 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:01,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:01,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:01,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:01,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:01,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:01,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,651 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:52:01,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:01,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:01,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:01,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:01,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:01,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:02,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:02,252 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:52:02,601 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2021-06-11 15:52:02,732 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 15:52:02,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:02,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:52:02,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:02,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,771 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:52:02,771 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:52:02,774 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,778 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:52:02,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:02,781 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:52:02,782 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:52:02,783 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:52:02,785 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,788 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:52:02,790 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:52:02,790 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:52:02,791 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,799 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:52:02,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:02,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:02,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:02,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:52:02,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 15:52:02,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:03,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:03,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:03,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:03,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:03,404 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 15:52:03,664 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 15:52:04,216 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 15:52:04,776 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 15:52:04,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:04,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:04,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:04,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:04,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:04,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:04,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:05,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:05,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:05,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:05,116 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:52:05,474 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 15:52:05,775 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 15:52:06,361 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-06-11 15:52:06,968 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-06-11 15:52:06,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:06,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:07,517 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-06-11 15:52:07,778 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-11 15:52:08,328 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 15:52:08,843 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 15:52:08,970 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-11 15:52:09,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:09,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:09,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:09,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:09,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:09,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:09,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:09,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:09,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:09,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:09,919 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 196 [2021-06-11 15:52:10,225 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 15:52:10,913 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 15:52:11,571 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 15:52:11,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:11,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:11,831 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-06-11 15:52:11,936 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-11 15:52:12,159 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-06-11 15:52:12,263 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-11 15:52:12,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:52:12,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:12,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:12,333 INFO L163 LiptonReduction]: Checked pairs total: 2706 [2021-06-11 15:52:12,333 INFO L165 LiptonReduction]: Total number of compositions: 78 [2021-06-11 15:52:12,351 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14202 [2021-06-11 15:52:12,359 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-06-11 15:52:12,360 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:52:12,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:12,360 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 15:52:12,360 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash 883237218, now seen corresponding path program 1 times [2021-06-11 15:52:12,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:12,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249195894] [2021-06-11 15:52:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:12,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:52:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:12,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249195894] [2021-06-11 15:52:12,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:12,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:52:12,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219220226] [2021-06-11 15:52:12,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:52:12,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:52:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:52:12,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 158 [2021-06-11 15:52:12,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:12,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 158 [2021-06-11 15:52:12,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:12,543 INFO L129 PetriNetUnfolder]: 23/72 cut-off events. [2021-06-11 15:52:12,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:52:12,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 72 events. 23/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 270 event pairs, 3 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 118. Up to 37 conditions per place. [2021-06-11 15:52:12,545 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 7 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2021-06-11 15:52:12,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 70 flow [2021-06-11 15:52:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:52:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:52:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-06-11 15:52:12,554 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7911392405063291 [2021-06-11 15:52:12,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-06-11 15:52:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-06-11 15:52:12,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:12,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-06-11 15:52:12,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,564 INFO L185 Difference]: Start difference. First operand has 26 places, 21 transitions, 48 flow. Second operand 3 states and 375 transitions. [2021-06-11 15:52:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 70 flow [2021-06-11 15:52:12,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:52:12,566 INFO L241 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2021-06-11 15:52:12,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2021-06-11 15:52:12,567 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2021-06-11 15:52:12,568 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:12,568 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 40 flow [2021-06-11 15:52:12,568 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 40 flow [2021-06-11 15:52:12,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2021-06-11 15:52:12,570 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 15:52:12,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:52:12,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:52:12,571 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 15:52:12,630 INFO L163 LiptonReduction]: Checked pairs total: 124 [2021-06-11 15:52:12,630 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:12,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-06-11 15:52:12,631 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-06-11 15:52:12,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:12,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:12,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:52:12,631 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1612492707, now seen corresponding path program 1 times [2021-06-11 15:52:12,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:12,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439809846] [2021-06-11 15:52:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:12,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:52:12,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:12,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439809846] [2021-06-11 15:52:12,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:12,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:52:12,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983090266] [2021-06-11 15:52:12,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:52:12,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:52:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:52:12,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 158 [2021-06-11 15:52:12,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:12,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 158 [2021-06-11 15:52:12,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:12,825 INFO L129 PetriNetUnfolder]: 24/69 cut-off events. [2021-06-11 15:52:12,826 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-11 15:52:12,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 69 events. 24/69 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 235 event pairs, 11 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 125. Up to 45 conditions per place. [2021-06-11 15:52:12,827 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 8 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2021-06-11 15:52:12,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 80 flow [2021-06-11 15:52:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:52:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:52:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2021-06-11 15:52:12,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.694620253164557 [2021-06-11 15:52:12,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2021-06-11 15:52:12,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2021-06-11 15:52:12,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:12,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2021-06-11 15:52:12,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,833 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 4 states and 439 transitions. [2021-06-11 15:52:12,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 80 flow [2021-06-11 15:52:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:52:12,833 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 70 flow [2021-06-11 15:52:12,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, 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=70, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-06-11 15:52:12,834 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2021-06-11 15:52:12,834 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:12,834 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 70 flow [2021-06-11 15:52:12,834 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2021-06-11 15:52:12,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2021-06-11 15:52:12,838 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-06-11 15:52:12,838 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-06-11 15:52:12,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 29 events. 3/29 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 48. Up to 8 conditions per place. [2021-06-11 15:52:12,839 INFO L151 LiptonReduction]: Number of co-enabled transitions 128 [2021-06-11 15:52:12,884 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 15:52:12,885 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:12,885 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-06-11 15:52:12,885 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 70 flow [2021-06-11 15:52:12,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:12,886 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:12,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:52:12,886 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1035621410, now seen corresponding path program 1 times [2021-06-11 15:52:12,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:12,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876923023] [2021-06-11 15:52:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:12,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:52:12,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:52:12,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:12,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:12,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876923023] [2021-06-11 15:52:12,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:12,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:52:12,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401914363] [2021-06-11 15:52:12,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:52:12,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:52:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:52:12,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 158 [2021-06-11 15:52:12,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:12,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 158 [2021-06-11 15:52:12,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:12,986 INFO L129 PetriNetUnfolder]: 22/62 cut-off events. [2021-06-11 15:52:12,986 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-11 15:52:12,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 62 events. 22/62 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 202 event pairs, 11 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 149. Up to 38 conditions per place. [2021-06-11 15:52:12,987 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 10 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2021-06-11 15:52:12,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 118 flow [2021-06-11 15:52:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:52:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:52:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2021-06-11 15:52:12,989 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7246835443037974 [2021-06-11 15:52:12,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2021-06-11 15:52:12,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2021-06-11 15:52:12,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:12,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2021-06-11 15:52:12,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,992 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:12,992 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 70 flow. Second operand 4 states and 458 transitions. [2021-06-11 15:52:12,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 118 flow [2021-06-11 15:52:12,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:52:12,993 INFO L241 Difference]: Finished difference. Result has 30 places, 22 transitions, 95 flow [2021-06-11 15:52:12,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2021-06-11 15:52:12,993 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2021-06-11 15:52:12,993 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:12,993 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 95 flow [2021-06-11 15:52:12,993 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 95 flow [2021-06-11 15:52:12,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 95 flow [2021-06-11 15:52:12,998 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-06-11 15:52:12,998 INFO L130 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2021-06-11 15:52:12,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 36 events. 7/36 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 3 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 79. Up to 12 conditions per place. [2021-06-11 15:52:12,998 INFO L151 LiptonReduction]: Number of co-enabled transitions 136 [2021-06-11 15:52:13,057 INFO L163 LiptonReduction]: Checked pairs total: 88 [2021-06-11 15:52:13,057 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,057 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-06-11 15:52:13,058 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 95 flow [2021-06-11 15:52:13,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:52:13,058 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1686887685, now seen corresponding path program 1 times [2021-06-11 15:52:13,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423561980] [2021-06-11 15:52:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:52:13,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,156 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-11 15:52:13,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 15:52:13,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423561980] [2021-06-11 15:52:13,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:52:13,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517919372] [2021-06-11 15:52:13,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:52:13,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:52:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:52:13,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 158 [2021-06-11 15:52:13,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 158 [2021-06-11 15:52:13,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:13,248 INFO L129 PetriNetUnfolder]: 26/74 cut-off events. [2021-06-11 15:52:13,249 INFO L130 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2021-06-11 15:52:13,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 74 events. 26/74 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 261 event pairs, 2 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 204. Up to 41 conditions per place. [2021-06-11 15:52:13,250 INFO L132 encePairwiseOnDemand]: 151/158 looper letters, 11 selfloop transitions, 10 changer transitions 0/30 dead transitions. [2021-06-11 15:52:13,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 171 flow [2021-06-11 15:52:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:52:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:52:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2021-06-11 15:52:13,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6936708860759494 [2021-06-11 15:52:13,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2021-06-11 15:52:13,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2021-06-11 15:52:13,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:13,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2021-06-11 15:52:13,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,256 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,256 INFO L185 Difference]: Start difference. First operand has 30 places, 22 transitions, 95 flow. Second operand 5 states and 548 transitions. [2021-06-11 15:52:13,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 171 flow [2021-06-11 15:52:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 162 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:52:13,258 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 145 flow [2021-06-11 15:52:13,258 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-06-11 15:52:13,258 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2021-06-11 15:52:13,258 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:13,258 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 145 flow [2021-06-11 15:52:13,259 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 145 flow [2021-06-11 15:52:13,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 145 flow [2021-06-11 15:52:13,268 INFO L129 PetriNetUnfolder]: 18/62 cut-off events. [2021-06-11 15:52:13,268 INFO L130 PetriNetUnfolder]: For 80/81 co-relation queries the response was YES. [2021-06-11 15:52:13,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 62 events. 18/62 cut-off events. For 80/81 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 217 event pairs, 3 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2021-06-11 15:52:13,270 INFO L151 LiptonReduction]: Number of co-enabled transitions 142 [2021-06-11 15:52:13,272 INFO L163 LiptonReduction]: Checked pairs total: 89 [2021-06-11 15:52:13,272 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,272 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 15:52:13,274 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 145 flow [2021-06-11 15:52:13,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,275 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:52:13,275 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1438431403, now seen corresponding path program 1 times [2021-06-11 15:52:13,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733479903] [2021-06-11 15:52:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:13,365 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-06-11 15:52:13,366 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-06-11 15:52:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733479903] [2021-06-11 15:52:13,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:52:13,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578103070] [2021-06-11 15:52:13,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:52:13,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:52:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:52:13,383 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 158 [2021-06-11 15:52:13,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 158 [2021-06-11 15:52:13,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:13,425 INFO L129 PetriNetUnfolder]: 25/68 cut-off events. [2021-06-11 15:52:13,425 INFO L130 PetriNetUnfolder]: For 115/118 co-relation queries the response was YES. [2021-06-11 15:52:13,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 68 events. 25/68 cut-off events. For 115/118 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 218 event pairs, 6 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 233. Up to 43 conditions per place. [2021-06-11 15:52:13,426 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 14 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2021-06-11 15:52:13,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 193 flow [2021-06-11 15:52:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:52:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:52:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2021-06-11 15:52:13,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7167721518987342 [2021-06-11 15:52:13,428 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2021-06-11 15:52:13,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2021-06-11 15:52:13,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:13,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2021-06-11 15:52:13,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,430 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,430 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 145 flow. Second operand 4 states and 453 transitions. [2021-06-11 15:52:13,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 193 flow [2021-06-11 15:52:13,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 183 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:52:13,432 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 153 flow [2021-06-11 15:52:13,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-06-11 15:52:13,432 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2021-06-11 15:52:13,432 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:13,432 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 153 flow [2021-06-11 15:52:13,432 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 153 flow [2021-06-11 15:52:13,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 153 flow [2021-06-11 15:52:13,439 INFO L129 PetriNetUnfolder]: 18/63 cut-off events. [2021-06-11 15:52:13,439 INFO L130 PetriNetUnfolder]: For 134/137 co-relation queries the response was YES. [2021-06-11 15:52:13,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 63 events. 18/63 cut-off events. For 134/137 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 212 event pairs, 7 based on Foata normal form. 3/65 useless extension candidates. Maximal degree in co-relation 179. Up to 24 conditions per place. [2021-06-11 15:52:13,440 INFO L151 LiptonReduction]: Number of co-enabled transitions 142 [2021-06-11 15:52:13,441 INFO L163 LiptonReduction]: Checked pairs total: 89 [2021-06-11 15:52:13,441 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,441 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 15:52:13,442 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 153 flow [2021-06-11 15:52:13,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,442 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:52:13,442 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash 405165257, now seen corresponding path program 2 times [2021-06-11 15:52:13,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151842927] [2021-06-11 15:52:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:13,487 INFO L142 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size [2021-06-11 15:52:13,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:13,495 INFO L142 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size [2021-06-11 15:52:13,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:52:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151842927] [2021-06-11 15:52:13,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:52:13,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826085659] [2021-06-11 15:52:13,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:52:13,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:52:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:52:13,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 158 [2021-06-11 15:52:13,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 158 [2021-06-11 15:52:13,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:13,562 INFO L129 PetriNetUnfolder]: 24/74 cut-off events. [2021-06-11 15:52:13,563 INFO L130 PetriNetUnfolder]: For 169/171 co-relation queries the response was YES. [2021-06-11 15:52:13,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 74 events. 24/74 cut-off events. For 169/171 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 1 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 241. Up to 30 conditions per place. [2021-06-11 15:52:13,563 INFO L132 encePairwiseOnDemand]: 151/158 looper letters, 9 selfloop transitions, 13 changer transitions 0/31 dead transitions. [2021-06-11 15:52:13,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 217 flow [2021-06-11 15:52:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:52:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:52:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2021-06-11 15:52:13,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7063291139240506 [2021-06-11 15:52:13,565 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2021-06-11 15:52:13,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2021-06-11 15:52:13,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:13,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2021-06-11 15:52:13,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,568 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,568 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 153 flow. Second operand 5 states and 558 transitions. [2021-06-11 15:52:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 217 flow [2021-06-11 15:52:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 207 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:52:13,569 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 196 flow [2021-06-11 15:52:13,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-06-11 15:52:13,570 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2021-06-11 15:52:13,570 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:13,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 196 flow [2021-06-11 15:52:13,570 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 196 flow [2021-06-11 15:52:13,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 196 flow [2021-06-11 15:52:13,576 INFO L129 PetriNetUnfolder]: 17/62 cut-off events. [2021-06-11 15:52:13,576 INFO L130 PetriNetUnfolder]: For 150/151 co-relation queries the response was YES. [2021-06-11 15:52:13,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 62 events. 17/62 cut-off events. For 150/151 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 225 event pairs, 4 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 213. Up to 25 conditions per place. [2021-06-11 15:52:13,577 INFO L151 LiptonReduction]: Number of co-enabled transitions 156 [2021-06-11 15:52:13,579 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 15:52:13,579 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 15:52:13,580 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 196 flow [2021-06-11 15:52:13,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:52:13,580 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1438260593, now seen corresponding path program 1 times [2021-06-11 15:52:13,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831856607] [2021-06-11 15:52:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:52:13,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:52:13,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831856607] [2021-06-11 15:52:13,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:52:13,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836258000] [2021-06-11 15:52:13,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:52:13,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:52:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:52:13,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 158 [2021-06-11 15:52:13,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 158 [2021-06-11 15:52:13,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:13,662 INFO L129 PetriNetUnfolder]: 20/76 cut-off events. [2021-06-11 15:52:13,662 INFO L130 PetriNetUnfolder]: For 148/157 co-relation queries the response was YES. [2021-06-11 15:52:13,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 76 events. 20/76 cut-off events. For 148/157 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 280 event pairs, 3 based on Foata normal form. 13/75 useless extension candidates. Maximal degree in co-relation 216. Up to 25 conditions per place. [2021-06-11 15:52:13,662 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 4 selfloop transitions, 8 changer transitions 2/34 dead transitions. [2021-06-11 15:52:13,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 216 flow [2021-06-11 15:52:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:52:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:52:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2021-06-11 15:52:13,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7670886075949367 [2021-06-11 15:52:13,664 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2021-06-11 15:52:13,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2021-06-11 15:52:13,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:13,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2021-06-11 15:52:13,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,668 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,668 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 196 flow. Second operand 5 states and 606 transitions. [2021-06-11 15:52:13,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 216 flow [2021-06-11 15:52:13,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 177 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-11 15:52:13,670 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 183 flow [2021-06-11 15:52:13,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-06-11 15:52:13,670 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2021-06-11 15:52:13,670 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:13,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 183 flow [2021-06-11 15:52:13,671 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 183 flow [2021-06-11 15:52:13,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 183 flow [2021-06-11 15:52:13,677 INFO L129 PetriNetUnfolder]: 12/59 cut-off events. [2021-06-11 15:52:13,677 INFO L130 PetriNetUnfolder]: For 73/78 co-relation queries the response was YES. [2021-06-11 15:52:13,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 59 events. 12/59 cut-off events. For 73/78 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 225 event pairs, 1 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 162. Up to 15 conditions per place. [2021-06-11 15:52:13,678 INFO L151 LiptonReduction]: Number of co-enabled transitions 180 [2021-06-11 15:52:13,680 INFO L163 LiptonReduction]: Checked pairs total: 99 [2021-06-11 15:52:13,680 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,680 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 15:52:13,680 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 183 flow [2021-06-11 15:52:13,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,681 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:52:13,681 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1187012087, now seen corresponding path program 1 times [2021-06-11 15:52:13,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745454761] [2021-06-11 15:52:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:52:13,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:52:13,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:52:13,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745454761] [2021-06-11 15:52:13,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:52:13,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951231172] [2021-06-11 15:52:13,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:52:13,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:52:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:52:13,734 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 158 [2021-06-11 15:52:13,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 158 [2021-06-11 15:52:13,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:13,774 INFO L129 PetriNetUnfolder]: 12/58 cut-off events. [2021-06-11 15:52:13,774 INFO L130 PetriNetUnfolder]: For 115/163 co-relation queries the response was YES. [2021-06-11 15:52:13,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 58 events. 12/58 cut-off events. For 115/163 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 197 event pairs, 0 based on Foata normal form. 27/79 useless extension candidates. Maximal degree in co-relation 184. Up to 20 conditions per place. [2021-06-11 15:52:13,775 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 2 selfloop transitions, 11 changer transitions 3/36 dead transitions. [2021-06-11 15:52:13,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 232 flow [2021-06-11 15:52:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:52:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:52:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2021-06-11 15:52:13,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7631103074141049 [2021-06-11 15:52:13,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2021-06-11 15:52:13,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2021-06-11 15:52:13,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:13,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2021-06-11 15:52:13,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,780 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 183 flow. Second operand 7 states and 844 transitions. [2021-06-11 15:52:13,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 232 flow [2021-06-11 15:52:13,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 223 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-06-11 15:52:13,782 INFO L241 Difference]: Finished difference. Result has 50 places, 33 transitions, 216 flow [2021-06-11 15:52:13,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2021-06-11 15:52:13,782 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2021-06-11 15:52:13,782 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:13,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 33 transitions, 216 flow [2021-06-11 15:52:13,782 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 33 transitions, 216 flow [2021-06-11 15:52:13,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 33 transitions, 216 flow [2021-06-11 15:52:13,787 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-06-11 15:52:13,787 INFO L130 PetriNetUnfolder]: For 122/130 co-relation queries the response was YES. [2021-06-11 15:52:13,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 50 events. 10/50 cut-off events. For 122/130 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 169 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2021-06-11 15:52:13,787 INFO L151 LiptonReduction]: Number of co-enabled transitions 148 [2021-06-11 15:52:13,789 INFO L163 LiptonReduction]: Checked pairs total: 93 [2021-06-11 15:52:13,789 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,789 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 15:52:13,790 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 216 flow [2021-06-11 15:52:13,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,790 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:52:13,790 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1282401900, now seen corresponding path program 1 times [2021-06-11 15:52:13,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446828421] [2021-06-11 15:52:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:13,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:52:13,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:52:13,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:52:13,874 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-06-11 15:52:13,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-06-11 15:52:13,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:52:13,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:13,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:52:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:13,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446828421] [2021-06-11 15:52:13,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:13,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:52:13,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683056385] [2021-06-11 15:52:13,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 15:52:13,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:13,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 15:52:13,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-11 15:52:13,933 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 158 [2021-06-11 15:52:13,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:13,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:13,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 158 [2021-06-11 15:52:13,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:14,039 INFO L129 PetriNetUnfolder]: 24/104 cut-off events. [2021-06-11 15:52:14,040 INFO L130 PetriNetUnfolder]: For 321/374 co-relation queries the response was YES. [2021-06-11 15:52:14,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 104 events. 24/104 cut-off events. For 321/374 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 483 event pairs, 0 based on Foata normal form. 26/119 useless extension candidates. Maximal degree in co-relation 388. Up to 40 conditions per place. [2021-06-11 15:52:14,040 INFO L132 encePairwiseOnDemand]: 150/158 looper letters, 11 selfloop transitions, 3 changer transitions 21/48 dead transitions. [2021-06-11 15:52:14,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 367 flow [2021-06-11 15:52:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:52:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:52:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 880 transitions. [2021-06-11 15:52:14,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6188466947960619 [2021-06-11 15:52:14,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 880 transitions. [2021-06-11 15:52:14,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 880 transitions. [2021-06-11 15:52:14,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:14,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 880 transitions. [2021-06-11 15:52:14,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:14,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:14,046 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:14,046 INFO L185 Difference]: Start difference. First operand has 49 places, 33 transitions, 216 flow. Second operand 9 states and 880 transitions. [2021-06-11 15:52:14,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 367 flow [2021-06-11 15:52:14,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 334 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-11 15:52:14,048 INFO L241 Difference]: Finished difference. Result has 55 places, 26 transitions, 152 flow [2021-06-11 15:52:14,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=26} [2021-06-11 15:52:14,049 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2021-06-11 15:52:14,049 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:14,049 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 26 transitions, 152 flow [2021-06-11 15:52:14,049 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 26 transitions, 152 flow [2021-06-11 15:52:14,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 26 transitions, 152 flow [2021-06-11 15:52:14,053 INFO L129 PetriNetUnfolder]: 4/38 cut-off events. [2021-06-11 15:52:14,053 INFO L130 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2021-06-11 15:52:14,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 38 events. 4/38 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 116. Up to 12 conditions per place. [2021-06-11 15:52:14,053 INFO L151 LiptonReduction]: Number of co-enabled transitions 72 [2021-06-11 15:52:14,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:14,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:14,097 INFO L163 LiptonReduction]: Checked pairs total: 14 [2021-06-11 15:52:14,097 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:52:14,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-06-11 15:52:14,097 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 153 flow [2021-06-11 15:52:14,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:52:14,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:14,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:14,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:52:14,098 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 281873726, now seen corresponding path program 2 times [2021-06-11 15:52:14,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:14,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241866763] [2021-06-11 15:52:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:52:14,123 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:52:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:52:14,148 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:52:14,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:52:14,176 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:52:14,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:52:14,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:52:14 BasicIcfg [2021-06-11 15:52:14,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:52:14,232 INFO L168 Benchmark]: Toolchain (without parser) took 17894.61 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 329.4 MB in the beginning and 527.1 MB in the end (delta: -197.7 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,232 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 367.0 MB. Free memory is still 347.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:52:14,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.97 ms. Allocated memory is still 367.0 MB. Free memory was 329.2 MB in the beginning and 325.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,235 INFO L168 Benchmark]: Boogie Preprocessor took 22.66 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 321.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,235 INFO L168 Benchmark]: RCFGBuilder took 1224.65 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 333.5 MB in the end (delta: -13.1 MB). Peak memory consumption was 195.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,238 INFO L168 Benchmark]: TraceAbstraction took 16213.76 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 332.5 MB in the beginning and 527.1 MB in the end (delta: -194.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:14,239 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.11 ms. Allocated memory is still 367.0 MB. Free memory is still 347.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 392.97 ms. Allocated memory is still 367.0 MB. Free memory was 329.2 MB in the beginning and 325.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.66 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 321.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1224.65 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 333.5 MB in the end (delta: -13.1 MB). Peak memory consumption was 195.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16213.76 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 332.5 MB in the beginning and 527.1 MB in the end (delta: -194.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14185.2ms, 83 PlacesBefore, 26 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 78 TotalNumberOfCompositions, 2706 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1134, positive: 1018, positive conditional: 1018, positive unconditional: 0, negative: 116, negative conditional: 116, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1134, positive: 1018, positive conditional: 0, positive unconditional: 1018, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1134, positive: 1018, positive conditional: 0, positive unconditional: 1018, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 737, positive: 694, positive conditional: 0, positive unconditional: 694, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 737, positive: 679, positive conditional: 0, positive unconditional: 679, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 544, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 519, negative conditional: 0, negative unconditional: 519, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1134, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 737, unknown conditional: 0, unknown unconditional: 737] , Statistics on independence cache: Total cache size (in pairs): 737, Positive cache size: 694, Positive conditional cache size: 0, Positive unconditional cache size: 694, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.0ms, 24 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 697, Positive conditional cache size: 0, Positive unconditional cache size: 697, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.2ms, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 41, positive conditional: 8, positive unconditional: 33, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 41, positive conditional: 8, positive unconditional: 33, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 35, positive conditional: 3, positive unconditional: 32, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 703, Positive conditional cache size: 5, Positive unconditional cache size: 698, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.8ms, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 36, positive conditional: 9, positive unconditional: 27, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 36, positive conditional: 9, positive unconditional: 27, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 30, positive conditional: 3, positive unconditional: 27, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 709, Positive conditional cache size: 11, Positive unconditional cache size: 698, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 89 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, positive: 37, positive conditional: 8, positive unconditional: 29, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 37, positive conditional: 8, positive unconditional: 29, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 36, positive conditional: 8, positive unconditional: 28, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 89 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 28, positive conditional: 5, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 28, positive conditional: 5, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 28, positive conditional: 5, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 35, positive conditional: 6, positive unconditional: 29, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 35, positive conditional: 6, positive unconditional: 29, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 35, positive conditional: 6, positive unconditional: 29, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 99 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, positive: 25, positive conditional: 8, positive unconditional: 17, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 25, positive conditional: 8, positive unconditional: 17, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 25, positive conditional: 8, positive unconditional: 17, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9ms, 50 PlacesBefore, 49 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 93 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 27, positive conditional: 15, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 27, positive conditional: 15, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 27, positive conditional: 15, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.9ms, 55 PlacesBefore, 46 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 710, Positive conditional cache size: 11, Positive unconditional cache size: 699, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 0 - 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; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L742] 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) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] 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) [L742] 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) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 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 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 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 [L770] 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) [L770] 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) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 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 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 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 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] 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) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] 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) [L801] 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) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 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 [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 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 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L812] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 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=0, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16083.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 558.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14260.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 25 SDslu, 21 SDs, 0 SdLazy, 247 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 221.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 220.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=8, InterpolantAutomatonStates: 46, 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: 28.8ms SsaConstructionTime, 304.9ms SatisfiabilityAnalysisTime, 491.4ms InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...