/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:37:48,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:37:48,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:37:48,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:37:48,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:37:48,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:37:48,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:37:48,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:37:48,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:37:48,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:37:48,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:37:48,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:37:48,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:37:48,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:37:48,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:37:48,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:37:48,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:37:48,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:37:48,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:37:48,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:37:48,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:37:48,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:37:48,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:37:48,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:37:48,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:37:48,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:37:48,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:37:48,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:37:48,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:37:48,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:37:48,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:37:48,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:37:48,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:37:48,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:37:48,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:37:48,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:37:48,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:37:48,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:37:48,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:37:48,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:37:48,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:37:48,293 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:37:48,341 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:37:48,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:37:48,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:37:48,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:37:48,347 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:37:48,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:37:48,347 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:37:48,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:37:48,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:37:48,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:37:48,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:37:48,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:37:48,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:37:48,349 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:37:48,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:37:48,350 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:37:48,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:37:48,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:37:48,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:37:48,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:37:48,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:37:48,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:37:48,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:37:48,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:37:48,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:37:48,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:37:48,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:37:48,353 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:37:48,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:37:48,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:37:48,353 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-04-29 00:37:48,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:37:48,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:37:48,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:37:48,759 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:37:48,760 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:37:48,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-04-29 00:37:48,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b7ffdc92/e0e2f30738b54970906a5c29f2dc8483/FLAG8ca627489 [2021-04-29 00:37:49,648 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:37:49,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-04-29 00:37:49,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b7ffdc92/e0e2f30738b54970906a5c29f2dc8483/FLAG8ca627489 [2021-04-29 00:37:49,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b7ffdc92/e0e2f30738b54970906a5c29f2dc8483 [2021-04-29 00:37:49,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:37:49,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:37:49,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:37:49,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:37:49,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:37:49,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:37:49" (1/1) ... [2021-04-29 00:37:49,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dc3788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:49, skipping insertion in model container [2021-04-29 00:37:49,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:37:49" (1/1) ... [2021-04-29 00:37:50,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:37:50,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:37:50,331 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/safe030_power.oepc.i[952,965] [2021-04-29 00:37:50,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:37:50,615 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:37:50,626 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/safe030_power.oepc.i[952,965] [2021-04-29 00:37:50,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:37:50,850 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:37:50,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50 WrapperNode [2021-04-29 00:37:50,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:37:50,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:37:50,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:37:50,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:37:50,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:37:50,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:37:50,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:37:50,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:37:50,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:50,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:51,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:51,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... [2021-04-29 00:37:51,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:37:51,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:37:51,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:37:51,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:37:51,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:37:51,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:37:51,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:37:51,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:37:51,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:37:51,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:37:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:37:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:37:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:37:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:37:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:37:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:37:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:37:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:37:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:37:51,154 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:37:53,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:37:53,505 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:37:53,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:37:53 BoogieIcfgContainer [2021-04-29 00:37:53,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:37:53,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:37:53,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:37:53,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:37:53,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:37:49" (1/3) ... [2021-04-29 00:37:53,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:37:53, skipping insertion in model container [2021-04-29 00:37:53,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:37:50" (2/3) ... [2021-04-29 00:37:53,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:37:53, skipping insertion in model container [2021-04-29 00:37:53,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:37:53" (3/3) ... [2021-04-29 00:37:53,516 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2021-04-29 00:37:53,523 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:37:53,528 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:37:53,528 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:37:53,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,566 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,566 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,576 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,583 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,583 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:37:53,593 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:37:53,615 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:37:53,640 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:37:53,640 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:37:53,640 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:37:53,641 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:37:53,641 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:37:53,641 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:37:53,641 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:37:53,641 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:37:53,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-04-29 00:37:53,699 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-04-29 00:37:53,700 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:37:53,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:37:53,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-04-29 00:37:53,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-04-29 00:37:53,715 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:37:53,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-04-29 00:37:53,738 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-04-29 00:37:53,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-04-29 00:37:53,787 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-04-29 00:37:53,787 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:37:53,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:37:53,794 INFO L146 LiptonReduction]: Number of co-enabled transitions 1694 [2021-04-29 00:37:57,414 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-04-29 00:37:57,882 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-04-29 00:37:59,953 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-04-29 00:38:01,000 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:38:01,759 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:38:01,872 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:38:02,409 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-04-29 00:38:02,629 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-04-29 00:38:05,183 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-04-29 00:38:05,692 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-04-29 00:38:07,982 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-04-29 00:38:09,018 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 262 [2021-04-29 00:38:10,209 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-04-29 00:38:10,738 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:38:13,240 WARN L205 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-04-29 00:38:14,303 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:38:15,569 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:38:16,616 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-04-29 00:38:19,102 WARN L205 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:38:20,277 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:38:23,405 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2021-04-29 00:38:23,982 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:38:26,698 WARN L205 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-04-29 00:38:27,978 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 266 [2021-04-29 00:38:29,340 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:38:29,957 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:38:32,736 WARN L205 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-04-29 00:38:33,997 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:38:35,428 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2021-04-29 00:38:36,078 WARN L205 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:38:39,069 WARN L205 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-04-29 00:38:40,422 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 266 [2021-04-29 00:38:41,919 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-04-29 00:38:42,589 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:38:45,716 WARN L205 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-04-29 00:38:47,111 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:38:52,764 WARN L205 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-04-29 00:38:53,469 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-04-29 00:38:56,740 WARN L205 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-04-29 00:38:58,212 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:38:59,891 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:39:01,432 WARN L205 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-04-29 00:39:04,896 WARN L205 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-04-29 00:39:06,485 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:39:08,338 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2021-04-29 00:39:09,191 WARN L205 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:39:13,147 WARN L205 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-04-29 00:39:14,927 WARN L205 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 266 [2021-04-29 00:39:15,924 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-29 00:39:16,029 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-29 00:39:16,131 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-29 00:39:16,233 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-29 00:39:17,339 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:39:17,451 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:39:17,560 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:39:17,672 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:39:17,965 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-04-29 00:39:18,741 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:39:18,846 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:39:19,271 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:39:19,651 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:19,858 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:21,470 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:39:21,604 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:39:21,736 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:39:21,854 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:39:21,997 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:39:22,124 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:39:22,270 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:39:22,400 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:39:22,524 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:39:22,640 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:22,766 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:39:22,886 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:23,003 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:23,120 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:23,250 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:23,360 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:23,506 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:39:23,649 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:39:23,799 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:39:23,942 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:39:24,045 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:39:24,240 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:39:24,455 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:24,569 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:24,684 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:39:24,805 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:39:24,957 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:25,097 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:39:25,252 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:25,406 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:39:25,606 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:25,779 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:25,946 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:26,107 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:26,301 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:26,488 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:26,686 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:26,881 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:27,045 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:27,202 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:27,367 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:27,525 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:27,789 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:28,046 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:28,288 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:28,551 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:28,800 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:29,060 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:29,316 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:29,573 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:30,289 WARN L205 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-04-29 00:39:30,633 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-29 00:39:31,344 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-04-29 00:39:31,681 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-29 00:39:31,905 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:39:32,134 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:39:32,366 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:39:32,604 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:39:32,818 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:39:33,030 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:39:33,241 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:39:33,461 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:39:33,716 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:33,970 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:34,238 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:34,510 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:34,771 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:35,028 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:35,283 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:35,537 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:39:35,697 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:39:35,859 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:39:36,026 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:39:36,192 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:39:36,374 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:39:36,567 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:39:36,750 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:39:36,936 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:39:37,128 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:37,319 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:37,516 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:37,697 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:39:37,897 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:39:38,099 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:39:38,313 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:39:38,509 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:39:39,213 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2021-04-29 00:39:39,538 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-04-29 00:39:40,272 WARN L205 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2021-04-29 00:39:40,588 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-04-29 00:39:40,805 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:39:41,017 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:39:41,252 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:39:41,469 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:39:41,627 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:41,783 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:41,944 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:42,102 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:39:42,335 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:39:42,567 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:39:42,821 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:39:43,076 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:39:43,302 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:39:43,539 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:39:43,773 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:39:43,996 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:39:44,156 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:44,321 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:44,488 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:44,651 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:39:44,847 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:39:45,033 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:39:45,205 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:39:45,378 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:39:45,427 INFO L158 LiptonReduction]: Checked pairs total: 14752 [2021-04-29 00:39:45,427 INFO L160 LiptonReduction]: Total number of compositions: 199 [2021-04-29 00:39:45,431 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111717 [2021-04-29 00:39:45,450 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-04-29 00:39:45,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:39:45,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:45,451 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-04-29 00:39:45,452 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1154955, now seen corresponding path program 1 times [2021-04-29 00:39:45,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:45,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092187474] [2021-04-29 00:39:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:45,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:45,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:45,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092187474] [2021-04-29 00:39:45,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:45,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:39:45,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184526564] [2021-04-29 00:39:45,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:45,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:45,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 295 [2021-04-29 00:39:45,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-04-29 00:39:45,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:45,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 295 [2021-04-29 00:39:45,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:46,330 INFO L129 PetriNetUnfolder]: 329/755 cut-off events. [2021-04-29 00:39:46,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:39:46,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 755 events. 329/755 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5359 event pairs, 262 based on Foata normal form. 11/409 useless extension candidates. Maximal degree in co-relation 1244. Up to 401 conditions per place. [2021-04-29 00:39:46,337 INFO L132 encePairwiseOnDemand]: 279/295 looper letters, 9 selfloop transitions, 2 changer transitions 84/129 dead transitions. [2021-04-29 00:39:46,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 363 flow [2021-04-29 00:39:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2021-04-29 00:39:46,359 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8203389830508474 [2021-04-29 00:39:46,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2021-04-29 00:39:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2021-04-29 00:39:46,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:46,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2021-04-29 00:39:46,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-04-29 00:39:46,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:46,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:46,384 INFO L185 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 726 transitions. [2021-04-29 00:39:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 363 flow [2021-04-29 00:39:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 129 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:39:46,391 INFO L241 Difference]: Finished difference. Result has 120 places, 41 transitions, 92 flow [2021-04-29 00:39:46,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=120, PETRI_TRANSITIONS=41} [2021-04-29 00:39:46,394 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -4 predicate places. [2021-04-29 00:39:46,394 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:46,395 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 41 transitions, 92 flow [2021-04-29 00:39:46,395 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 41 transitions, 92 flow [2021-04-29 00:39:46,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-04-29 00:39:46,401 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-04-29 00:39:46,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:39:46,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 152 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:39:46,403 INFO L146 LiptonReduction]: Number of co-enabled transitions 938 [2021-04-29 00:39:46,773 INFO L158 LiptonReduction]: Checked pairs total: 900 [2021-04-29 00:39:46,773 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:46,773 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 379 [2021-04-29 00:39:46,775 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2021-04-29 00:39:46,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-04-29 00:39:46,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:46,776 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:46,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:39:46,777 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1758775002, now seen corresponding path program 1 times [2021-04-29 00:39:46,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:46,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027402476] [2021-04-29 00:39:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:46,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:46,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:46,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027402476] [2021-04-29 00:39:46,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:46,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:39:46,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823047881] [2021-04-29 00:39:46,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:46,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:46,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 295 [2021-04-29 00:39:46,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-04-29 00:39:46,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:46,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 295 [2021-04-29 00:39:46,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:47,020 INFO L129 PetriNetUnfolder]: 3/57 cut-off events. [2021-04-29 00:39:47,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:39:47,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 57 events. 3/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 187 event pairs, 1 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2021-04-29 00:39:47,021 INFO L132 encePairwiseOnDemand]: 291/295 looper letters, 3 selfloop transitions, 3 changer transitions 2/43 dead transitions. [2021-04-29 00:39:47,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 108 flow [2021-04-29 00:39:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2021-04-29 00:39:47,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7468926553672316 [2021-04-29 00:39:47,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2021-04-29 00:39:47,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2021-04-29 00:39:47,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:47,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2021-04-29 00:39:47,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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-04-29 00:39:47,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,035 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 661 transitions. [2021-04-29 00:39:47,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 108 flow [2021-04-29 00:39:47,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:39:47,036 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 103 flow [2021-04-29 00:39:47,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-04-29 00:39:47,037 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -73 predicate places. [2021-04-29 00:39:47,037 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:47,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 103 flow [2021-04-29 00:39:47,038 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 103 flow [2021-04-29 00:39:47,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 103 flow [2021-04-29 00:39:47,046 INFO L129 PetriNetUnfolder]: 3/53 cut-off events. [2021-04-29 00:39:47,047 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:39:47,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 53 events. 3/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 202 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 66. Up to 10 conditions per place. [2021-04-29 00:39:47,048 INFO L146 LiptonReduction]: Number of co-enabled transitions 948 [2021-04-29 00:39:47,545 INFO L158 LiptonReduction]: Checked pairs total: 821 [2021-04-29 00:39:47,545 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:47,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 509 [2021-04-29 00:39:47,547 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 103 flow [2021-04-29 00:39:47,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-04-29 00:39:47,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:47,549 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:47,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:39:47,549 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:47,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1311867155, now seen corresponding path program 1 times [2021-04-29 00:39:47,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:47,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26893397] [2021-04-29 00:39:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:47,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:47,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:47,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26893397] [2021-04-29 00:39:47,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:47,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:39:47,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207805249] [2021-04-29 00:39:47,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:47,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:47,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:47,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 295 [2021-04-29 00:39:47,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-04-29 00:39:47,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:47,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 295 [2021-04-29 00:39:47,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:47,761 INFO L129 PetriNetUnfolder]: 10/83 cut-off events. [2021-04-29 00:39:47,762 INFO L130 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2021-04-29 00:39:47,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 83 events. 10/83 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 334 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 120. Up to 19 conditions per place. [2021-04-29 00:39:47,763 INFO L132 encePairwiseOnDemand]: 291/295 looper letters, 3 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2021-04-29 00:39:47,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2021-04-29 00:39:47,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7502824858757062 [2021-04-29 00:39:47,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2021-04-29 00:39:47,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2021-04-29 00:39:47,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:47,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2021-04-29 00:39:47,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:39:47,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,775 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 103 flow. Second operand 3 states and 664 transitions. [2021-04-29 00:39:47,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:47,777 INFO L241 Difference]: Finished difference. Result has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2021-04-29 00:39:47,778 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -73 predicate places. [2021-04-29 00:39:47,778 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:47,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,779 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,791 INFO L129 PetriNetUnfolder]: 10/79 cut-off events. [2021-04-29 00:39:47,791 INFO L130 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2021-04-29 00:39:47,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 79 events. 10/79 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 350 event pairs, 3 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 115. Up to 19 conditions per place. [2021-04-29 00:39:47,794 INFO L146 LiptonReduction]: Number of co-enabled transitions 1022 [2021-04-29 00:39:47,834 INFO L158 LiptonReduction]: Checked pairs total: 723 [2021-04-29 00:39:47,834 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:47,835 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-04-29 00:39:47,836 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 119 flow [2021-04-29 00:39:47,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-04-29 00:39:47,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:47,837 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:47,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:39:47,837 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2034260222, now seen corresponding path program 1 times [2021-04-29 00:39:47,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:47,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341912038] [2021-04-29 00:39:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:47,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:47,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:39:47,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:47,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:47,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341912038] [2021-04-29 00:39:47,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:47,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:39:47,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838423149] [2021-04-29 00:39:47,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:47,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:47,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 295 [2021-04-29 00:39:47,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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-04-29 00:39:47,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:47,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 295 [2021-04-29 00:39:47,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:47,959 INFO L129 PetriNetUnfolder]: 4/85 cut-off events. [2021-04-29 00:39:47,959 INFO L130 PetriNetUnfolder]: For 26/49 co-relation queries the response was YES. [2021-04-29 00:39:47,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 85 events. 4/85 cut-off events. For 26/49 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 391 event pairs, 1 based on Foata normal form. 3/55 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2021-04-29 00:39:47,961 INFO L132 encePairwiseOnDemand]: 292/295 looper letters, 3 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2021-04-29 00:39:47,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 131 flow [2021-04-29 00:39:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2021-04-29 00:39:47,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7457627118644068 [2021-04-29 00:39:47,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2021-04-29 00:39:47,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2021-04-29 00:39:47,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:47,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2021-04-29 00:39:47,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-04-29 00:39:47,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:47,973 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 119 flow. Second operand 3 states and 660 transitions. [2021-04-29 00:39:47,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 131 flow [2021-04-29 00:39:47,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:47,975 INFO L241 Difference]: Finished difference. Result has 53 places, 43 transitions, 127 flow [2021-04-29 00:39:47,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2021-04-29 00:39:47,976 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -71 predicate places. [2021-04-29 00:39:47,976 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:47,976 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 127 flow [2021-04-29 00:39:47,977 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 127 flow [2021-04-29 00:39:47,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 127 flow [2021-04-29 00:39:47,989 INFO L129 PetriNetUnfolder]: 4/85 cut-off events. [2021-04-29 00:39:47,989 INFO L130 PetriNetUnfolder]: For 29/35 co-relation queries the response was YES. [2021-04-29 00:39:47,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 85 events. 4/85 cut-off events. For 29/35 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 409 event pairs, 1 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2021-04-29 00:39:47,992 INFO L146 LiptonReduction]: Number of co-enabled transitions 1020 [2021-04-29 00:39:47,995 INFO L158 LiptonReduction]: Checked pairs total: 723 [2021-04-29 00:39:47,995 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:47,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-04-29 00:39:47,997 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 127 flow [2021-04-29 00:39:47,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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-04-29 00:39:47,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:47,998 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:47,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:39:47,998 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2011987063, now seen corresponding path program 1 times [2021-04-29 00:39:47,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:47,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207597520] [2021-04-29 00:39:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:48,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:39:48,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:48,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207597520] [2021-04-29 00:39:48,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:48,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:39:48,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026775291] [2021-04-29 00:39:48,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:48,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:48,144 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 295 [2021-04-29 00:39:48,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 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-04-29 00:39:48,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:48,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 295 [2021-04-29 00:39:48,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:48,298 INFO L129 PetriNetUnfolder]: 187/544 cut-off events. [2021-04-29 00:39:48,298 INFO L130 PetriNetUnfolder]: For 290/335 co-relation queries the response was YES. [2021-04-29 00:39:48,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 544 events. 187/544 cut-off events. For 290/335 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3840 event pairs, 142 based on Foata normal form. 3/378 useless extension candidates. Maximal degree in co-relation 1021. Up to 296 conditions per place. [2021-04-29 00:39:48,304 INFO L132 encePairwiseOnDemand]: 291/295 looper letters, 9 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2021-04-29 00:39:48,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 159 flow [2021-04-29 00:39:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-04-29 00:39:48,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6418079096045197 [2021-04-29 00:39:48,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-04-29 00:39:48,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-04-29 00:39:48,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:48,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-04-29 00:39:48,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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-04-29 00:39:48,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:48,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:48,315 INFO L185 Difference]: Start difference. First operand has 53 places, 43 transitions, 127 flow. Second operand 3 states and 568 transitions. [2021-04-29 00:39:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 159 flow [2021-04-29 00:39:48,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 154 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:48,319 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 141 flow [2021-04-29 00:39:48,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2021-04-29 00:39:48,320 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -69 predicate places. [2021-04-29 00:39:48,320 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:48,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 141 flow [2021-04-29 00:39:48,320 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 141 flow [2021-04-29 00:39:48,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 141 flow [2021-04-29 00:39:48,341 INFO L129 PetriNetUnfolder]: 17/137 cut-off events. [2021-04-29 00:39:48,341 INFO L130 PetriNetUnfolder]: For 84/91 co-relation queries the response was YES. [2021-04-29 00:39:48,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 137 events. 17/137 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 758 event pairs, 5 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 241. Up to 27 conditions per place. [2021-04-29 00:39:48,345 INFO L146 LiptonReduction]: Number of co-enabled transitions 1086 [2021-04-29 00:39:48,394 INFO L158 LiptonReduction]: Checked pairs total: 621 [2021-04-29 00:39:48,394 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:48,395 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-04-29 00:39:48,398 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 141 flow [2021-04-29 00:39:48,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 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-04-29 00:39:48,399 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:48,399 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:48,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:39:48,399 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1465542023, now seen corresponding path program 1 times [2021-04-29 00:39:48,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:48,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831347096] [2021-04-29 00:39:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:48,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:39:48,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:48,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831347096] [2021-04-29 00:39:48,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:48,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:39:48,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451263949] [2021-04-29 00:39:48,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:39:48,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:39:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:39:48,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 295 [2021-04-29 00:39:48,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-04-29 00:39:48,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:48,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 295 [2021-04-29 00:39:48,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:48,575 INFO L129 PetriNetUnfolder]: 8/140 cut-off events. [2021-04-29 00:39:48,575 INFO L130 PetriNetUnfolder]: For 176/223 co-relation queries the response was YES. [2021-04-29 00:39:48,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 140 events. 8/140 cut-off events. For 176/223 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 842 event pairs, 4 based on Foata normal form. 6/94 useless extension candidates. Maximal degree in co-relation 238. Up to 25 conditions per place. [2021-04-29 00:39:48,577 INFO L132 encePairwiseOnDemand]: 292/295 looper letters, 3 selfloop transitions, 3 changer transitions 1/45 dead transitions. [2021-04-29 00:39:48,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 153 flow [2021-04-29 00:39:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:39:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:39:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2021-04-29 00:39:48,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7491525423728813 [2021-04-29 00:39:48,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2021-04-29 00:39:48,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2021-04-29 00:39:48,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:48,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2021-04-29 00:39:48,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-04-29 00:39:48,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:48,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 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-04-29 00:39:48,590 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 141 flow. Second operand 3 states and 663 transitions. [2021-04-29 00:39:48,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 153 flow [2021-04-29 00:39:48,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:48,592 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 147 flow [2021-04-29 00:39:48,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2021-04-29 00:39:48,593 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -67 predicate places. [2021-04-29 00:39:48,593 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:48,593 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 147 flow [2021-04-29 00:39:48,593 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 147 flow [2021-04-29 00:39:48,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 147 flow [2021-04-29 00:39:48,616 INFO L129 PetriNetUnfolder]: 8/155 cut-off events. [2021-04-29 00:39:48,616 INFO L130 PetriNetUnfolder]: For 133/147 co-relation queries the response was YES. [2021-04-29 00:39:48,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 155 events. 8/155 cut-off events. For 133/147 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 973 event pairs, 3 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 267. Up to 25 conditions per place. [2021-04-29 00:39:48,620 INFO L146 LiptonReduction]: Number of co-enabled transitions 1030 [2021-04-29 00:39:48,665 INFO L158 LiptonReduction]: Checked pairs total: 606 [2021-04-29 00:39:48,665 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:48,666 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-04-29 00:39:48,667 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 147 flow [2021-04-29 00:39:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-04-29 00:39:48,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:48,668 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:48,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:39:48,668 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1903267294, now seen corresponding path program 1 times [2021-04-29 00:39:48,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:48,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842693488] [2021-04-29 00:39:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:48,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:39:48,770 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-04-29 00:39:48,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-04-29 00:39:48,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:48,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842693488] [2021-04-29 00:39:48,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:48,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:39:48,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328854196] [2021-04-29 00:39:48,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:39:48,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:39:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:39:48,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 295 [2021-04-29 00:39:48,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 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-04-29 00:39:48,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:48,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 295 [2021-04-29 00:39:48,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:49,135 INFO L129 PetriNetUnfolder]: 214/631 cut-off events. [2021-04-29 00:39:49,135 INFO L130 PetriNetUnfolder]: For 617/734 co-relation queries the response was YES. [2021-04-29 00:39:49,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 631 events. 214/631 cut-off events. For 617/734 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4556 event pairs, 75 based on Foata normal form. 12/459 useless extension candidates. Maximal degree in co-relation 1280. Up to 353 conditions per place. [2021-04-29 00:39:49,141 INFO L132 encePairwiseOnDemand]: 289/295 looper letters, 10 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2021-04-29 00:39:49,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 193 flow [2021-04-29 00:39:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:39:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:39:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 729 transitions. [2021-04-29 00:39:49,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6177966101694915 [2021-04-29 00:39:49,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 729 transitions. [2021-04-29 00:39:49,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 729 transitions. [2021-04-29 00:39:49,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:49,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 729 transitions. [2021-04-29 00:39:49,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 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-04-29 00:39:49,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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-04-29 00:39:49,154 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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-04-29 00:39:49,154 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 147 flow. Second operand 4 states and 729 transitions. [2021-04-29 00:39:49,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 193 flow [2021-04-29 00:39:49,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 188 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:49,158 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 174 flow [2021-04-29 00:39:49,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2021-04-29 00:39:49,158 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -65 predicate places. [2021-04-29 00:39:49,158 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:49,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 174 flow [2021-04-29 00:39:49,159 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 47 transitions, 174 flow [2021-04-29 00:39:49,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 174 flow [2021-04-29 00:39:49,202 INFO L129 PetriNetUnfolder]: 47/288 cut-off events. [2021-04-29 00:39:49,202 INFO L130 PetriNetUnfolder]: For 298/347 co-relation queries the response was YES. [2021-04-29 00:39:49,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 288 events. 47/288 cut-off events. For 298/347 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2087 event pairs, 19 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 560. Up to 98 conditions per place. [2021-04-29 00:39:49,210 INFO L146 LiptonReduction]: Number of co-enabled transitions 1124 [2021-04-29 00:39:49,287 INFO L158 LiptonReduction]: Checked pairs total: 255 [2021-04-29 00:39:49,288 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:49,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-04-29 00:39:49,289 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 174 flow [2021-04-29 00:39:49,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 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-04-29 00:39:49,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:49,290 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:49,290 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:39:49,291 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -598537270, now seen corresponding path program 1 times [2021-04-29 00:39:49,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:49,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426421700] [2021-04-29 00:39:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:49,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:49,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:39:49,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:39:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:49,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426421700] [2021-04-29 00:39:49,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:49,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:39:49,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842716049] [2021-04-29 00:39:49,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:39:49,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:49,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:39:49,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:39:49,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 295 [2021-04-29 00:39:49,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 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-04-29 00:39:49,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:49,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 295 [2021-04-29 00:39:49,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:49,728 INFO L129 PetriNetUnfolder]: 210/644 cut-off events. [2021-04-29 00:39:49,729 INFO L130 PetriNetUnfolder]: For 879/1124 co-relation queries the response was YES. [2021-04-29 00:39:49,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 644 events. 210/644 cut-off events. For 879/1124 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4753 event pairs, 86 based on Foata normal form. 21/467 useless extension candidates. Maximal degree in co-relation 1499. Up to 314 conditions per place. [2021-04-29 00:39:49,735 INFO L132 encePairwiseOnDemand]: 288/295 looper letters, 12 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2021-04-29 00:39:49,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 234 flow [2021-04-29 00:39:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:39:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:39:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 754 transitions. [2021-04-29 00:39:49,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6389830508474577 [2021-04-29 00:39:49,740 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 754 transitions. [2021-04-29 00:39:49,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 754 transitions. [2021-04-29 00:39:49,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:49,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 754 transitions. [2021-04-29 00:39:49,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 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-04-29 00:39:49,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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-04-29 00:39:49,746 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 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-04-29 00:39:49,746 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 174 flow. Second operand 4 states and 754 transitions. [2021-04-29 00:39:49,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 234 flow [2021-04-29 00:39:49,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-04-29 00:39:49,750 INFO L241 Difference]: Finished difference. Result has 62 places, 51 transitions, 214 flow [2021-04-29 00:39:49,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2021-04-29 00:39:49,750 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -62 predicate places. [2021-04-29 00:39:49,750 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:49,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 51 transitions, 214 flow [2021-04-29 00:39:49,751 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 51 transitions, 214 flow [2021-04-29 00:39:49,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 51 transitions, 214 flow [2021-04-29 00:39:49,839 INFO L129 PetriNetUnfolder]: 158/551 cut-off events. [2021-04-29 00:39:49,839 INFO L130 PetriNetUnfolder]: For 944/1018 co-relation queries the response was YES. [2021-04-29 00:39:49,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 551 events. 158/551 cut-off events. For 944/1018 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4292 event pairs, 87 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1274. Up to 208 conditions per place. [2021-04-29 00:39:49,852 INFO L146 LiptonReduction]: Number of co-enabled transitions 1212 [2021-04-29 00:39:49,858 INFO L158 LiptonReduction]: Checked pairs total: 64 [2021-04-29 00:39:49,858 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:49,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-04-29 00:39:49,860 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 214 flow [2021-04-29 00:39:49,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 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-04-29 00:39:49,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:49,861 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:49,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:39:49,861 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1789825117, now seen corresponding path program 1 times [2021-04-29 00:39:49,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:49,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868770709] [2021-04-29 00:39:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:49,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:39:49,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:39:49,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:39:49,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:49,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:50,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868770709] [2021-04-29 00:39:50,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:50,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:39:50,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146760263] [2021-04-29 00:39:50,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:39:50,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:39:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:39:50,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 295 [2021-04-29 00:39:50,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:39:50,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:50,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 295 [2021-04-29 00:39:50,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:50,361 INFO L129 PetriNetUnfolder]: 250/774 cut-off events. [2021-04-29 00:39:50,361 INFO L130 PetriNetUnfolder]: For 1337/1625 co-relation queries the response was YES. [2021-04-29 00:39:50,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 774 events. 250/774 cut-off events. For 1337/1625 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6094 event pairs, 26 based on Foata normal form. 27/577 useless extension candidates. Maximal degree in co-relation 2083. Up to 338 conditions per place. [2021-04-29 00:39:50,369 INFO L132 encePairwiseOnDemand]: 287/295 looper letters, 10 selfloop transitions, 14 changer transitions 0/58 dead transitions. [2021-04-29 00:39:50,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 294 flow [2021-04-29 00:39:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:39:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:39:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1101 transitions. [2021-04-29 00:39:50,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6220338983050847 [2021-04-29 00:39:50,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1101 transitions. [2021-04-29 00:39:50,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1101 transitions. [2021-04-29 00:39:50,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:50,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1101 transitions. [2021-04-29 00:39:50,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 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-04-29 00:39:50,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:50,384 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:50,384 INFO L185 Difference]: Start difference. First operand has 62 places, 51 transitions, 214 flow. Second operand 6 states and 1101 transitions. [2021-04-29 00:39:50,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 294 flow [2021-04-29 00:39:50,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 58 transitions, 286 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-04-29 00:39:50,388 INFO L241 Difference]: Finished difference. Result has 67 places, 55 transitions, 269 flow [2021-04-29 00:39:50,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2021-04-29 00:39:50,389 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -57 predicate places. [2021-04-29 00:39:50,389 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:50,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 55 transitions, 269 flow [2021-04-29 00:39:50,389 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 55 transitions, 269 flow [2021-04-29 00:39:50,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 55 transitions, 269 flow [2021-04-29 00:39:50,506 INFO L129 PetriNetUnfolder]: 234/691 cut-off events. [2021-04-29 00:39:50,506 INFO L130 PetriNetUnfolder]: For 1241/1404 co-relation queries the response was YES. [2021-04-29 00:39:50,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 691 events. 234/691 cut-off events. For 1241/1404 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5186 event pairs, 51 based on Foata normal form. 2/489 useless extension candidates. Maximal degree in co-relation 1975. Up to 317 conditions per place. [2021-04-29 00:39:50,523 INFO L146 LiptonReduction]: Number of co-enabled transitions 1332 [2021-04-29 00:39:50,529 INFO L158 LiptonReduction]: Checked pairs total: 105 [2021-04-29 00:39:50,529 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:50,529 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 140 [2021-04-29 00:39:50,531 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 269 flow [2021-04-29 00:39:50,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:39:50,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:50,532 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:50,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:39:50,532 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1275674539, now seen corresponding path program 2 times [2021-04-29 00:39:50,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:50,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268149833] [2021-04-29 00:39:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:50,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:50,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:39:50,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:50,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:39:50,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:50,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-29 00:39:50,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:50,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:39:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:50,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268149833] [2021-04-29 00:39:50,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:50,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:39:50,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134549751] [2021-04-29 00:39:50,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:39:50,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:39:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:39:50,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 295 [2021-04-29 00:39:50,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:50,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:50,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 295 [2021-04-29 00:39:50,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:51,139 INFO L129 PetriNetUnfolder]: 281/870 cut-off events. [2021-04-29 00:39:51,139 INFO L130 PetriNetUnfolder]: For 1809/2176 co-relation queries the response was YES. [2021-04-29 00:39:51,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 870 events. 281/870 cut-off events. For 1809/2176 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7035 event pairs, 26 based on Foata normal form. 33/658 useless extension candidates. Maximal degree in co-relation 2862. Up to 383 conditions per place. [2021-04-29 00:39:51,149 INFO L132 encePairwiseOnDemand]: 287/295 looper letters, 18 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2021-04-29 00:39:51,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 401 flow [2021-04-29 00:39:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:39:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:39:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1100 transitions. [2021-04-29 00:39:51,155 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2021-04-29 00:39:51,156 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1100 transitions. [2021-04-29 00:39:51,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1100 transitions. [2021-04-29 00:39:51,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:51,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1100 transitions. [2021-04-29 00:39:51,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 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-04-29 00:39:51,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:51,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:51,164 INFO L185 Difference]: Start difference. First operand has 67 places, 55 transitions, 269 flow. Second operand 6 states and 1100 transitions. [2021-04-29 00:39:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 401 flow [2021-04-29 00:39:51,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 65 transitions, 368 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-04-29 00:39:51,170 INFO L241 Difference]: Finished difference. Result has 71 places, 62 transitions, 338 flow [2021-04-29 00:39:51,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2021-04-29 00:39:51,171 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -53 predicate places. [2021-04-29 00:39:51,171 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:51,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 62 transitions, 338 flow [2021-04-29 00:39:51,171 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 62 transitions, 338 flow [2021-04-29 00:39:51,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 338 flow [2021-04-29 00:39:51,301 INFO L129 PetriNetUnfolder]: 263/804 cut-off events. [2021-04-29 00:39:51,302 INFO L130 PetriNetUnfolder]: For 1954/2120 co-relation queries the response was YES. [2021-04-29 00:39:51,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2612 conditions, 804 events. 263/804 cut-off events. For 1954/2120 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6451 event pairs, 61 based on Foata normal form. 8/578 useless extension candidates. Maximal degree in co-relation 2590. Up to 367 conditions per place. [2021-04-29 00:39:51,322 INFO L146 LiptonReduction]: Number of co-enabled transitions 1486 [2021-04-29 00:39:51,328 INFO L158 LiptonReduction]: Checked pairs total: 152 [2021-04-29 00:39:51,328 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:51,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 158 [2021-04-29 00:39:51,330 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 338 flow [2021-04-29 00:39:51,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:51,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:51,331 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:51,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:39:51,332 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 278271859, now seen corresponding path program 3 times [2021-04-29 00:39:51,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:51,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053903740] [2021-04-29 00:39:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:51,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:51,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:39:51,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:51,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:51,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:51,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-29 00:39:51,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:51,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:39:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:51,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053903740] [2021-04-29 00:39:51,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:51,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:39:51,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476230514] [2021-04-29 00:39:51,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:39:51,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:39:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:39:51,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 295 [2021-04-29 00:39:51,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:51,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:51,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 295 [2021-04-29 00:39:51,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:51,893 INFO L129 PetriNetUnfolder]: 289/864 cut-off events. [2021-04-29 00:39:51,894 INFO L130 PetriNetUnfolder]: For 3004/3330 co-relation queries the response was YES. [2021-04-29 00:39:51,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 864 events. 289/864 cut-off events. For 3004/3330 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6870 event pairs, 63 based on Foata normal form. 28/652 useless extension candidates. Maximal degree in co-relation 3256. Up to 440 conditions per place. [2021-04-29 00:39:51,904 INFO L132 encePairwiseOnDemand]: 287/295 looper letters, 19 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2021-04-29 00:39:51,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 456 flow [2021-04-29 00:39:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:39:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:39:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1104 transitions. [2021-04-29 00:39:51,910 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6237288135593221 [2021-04-29 00:39:51,911 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1104 transitions. [2021-04-29 00:39:51,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1104 transitions. [2021-04-29 00:39:51,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:51,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1104 transitions. [2021-04-29 00:39:51,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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-04-29 00:39:51,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:51,919 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 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-04-29 00:39:51,919 INFO L185 Difference]: Start difference. First operand has 71 places, 62 transitions, 338 flow. Second operand 6 states and 1104 transitions. [2021-04-29 00:39:51,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 456 flow [2021-04-29 00:39:51,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 437 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-04-29 00:39:51,929 INFO L241 Difference]: Finished difference. Result has 75 places, 65 transitions, 387 flow [2021-04-29 00:39:51,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2021-04-29 00:39:51,930 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -49 predicate places. [2021-04-29 00:39:51,930 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:51,930 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 65 transitions, 387 flow [2021-04-29 00:39:51,930 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 65 transitions, 387 flow [2021-04-29 00:39:51,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 65 transitions, 387 flow [2021-04-29 00:39:52,081 INFO L129 PetriNetUnfolder]: 274/790 cut-off events. [2021-04-29 00:39:52,081 INFO L130 PetriNetUnfolder]: For 2659/2833 co-relation queries the response was YES. [2021-04-29 00:39:52,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 790 events. 274/790 cut-off events. For 2659/2833 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6071 event pairs, 73 based on Foata normal form. 6/580 useless extension candidates. Maximal degree in co-relation 2849. Up to 348 conditions per place. [2021-04-29 00:39:52,100 INFO L146 LiptonReduction]: Number of co-enabled transitions 1518 [2021-04-29 00:39:52,108 INFO L158 LiptonReduction]: Checked pairs total: 152 [2021-04-29 00:39:52,108 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:52,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 179 [2021-04-29 00:39:52,110 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 387 flow [2021-04-29 00:39:52,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:52,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:52,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:52,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:39:52,111 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 731721259, now seen corresponding path program 4 times [2021-04-29 00:39:52,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:52,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330163290] [2021-04-29 00:39:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:52,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:39:52,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:39:52,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:39:52,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:39:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:52,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330163290] [2021-04-29 00:39:52,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:52,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:39:52,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425971113] [2021-04-29 00:39:52,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:39:52,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:39:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:39:52,283 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 295 [2021-04-29 00:39:52,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:52,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:52,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 295 [2021-04-29 00:39:52,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:52,677 INFO L129 PetriNetUnfolder]: 302/891 cut-off events. [2021-04-29 00:39:52,677 INFO L130 PetriNetUnfolder]: For 3995/4308 co-relation queries the response was YES. [2021-04-29 00:39:52,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 891 events. 302/891 cut-off events. For 3995/4308 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7118 event pairs, 25 based on Foata normal form. 45/697 useless extension candidates. Maximal degree in co-relation 3588. Up to 419 conditions per place. [2021-04-29 00:39:52,688 INFO L132 encePairwiseOnDemand]: 287/295 looper letters, 20 selfloop transitions, 25 changer transitions 0/79 dead transitions. [2021-04-29 00:39:52,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 591 flow [2021-04-29 00:39:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:39:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:39:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2021-04-29 00:39:52,694 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6250847457627119 [2021-04-29 00:39:52,694 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 922 transitions. [2021-04-29 00:39:52,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 922 transitions. [2021-04-29 00:39:52,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:52,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 922 transitions. [2021-04-29 00:39:52,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.4) internal successors, (922), 5 states have internal predecessors, (922), 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-04-29 00:39:52,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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-04-29 00:39:52,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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-04-29 00:39:52,701 INFO L185 Difference]: Start difference. First operand has 75 places, 65 transitions, 387 flow. Second operand 5 states and 922 transitions. [2021-04-29 00:39:52,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 591 flow [2021-04-29 00:39:52,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 517 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-04-29 00:39:52,711 INFO L241 Difference]: Finished difference. Result has 75 places, 74 transitions, 476 flow [2021-04-29 00:39:52,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2021-04-29 00:39:52,712 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -49 predicate places. [2021-04-29 00:39:52,712 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:52,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 74 transitions, 476 flow [2021-04-29 00:39:52,712 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 74 transitions, 476 flow [2021-04-29 00:39:52,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 476 flow [2021-04-29 00:39:52,852 INFO L129 PetriNetUnfolder]: 285/864 cut-off events. [2021-04-29 00:39:52,852 INFO L130 PetriNetUnfolder]: For 3324/3606 co-relation queries the response was YES. [2021-04-29 00:39:52,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3251 conditions, 864 events. 285/864 cut-off events. For 3324/3606 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6998 event pairs, 45 based on Foata normal form. 13/638 useless extension candidates. Maximal degree in co-relation 3228. Up to 351 conditions per place. [2021-04-29 00:39:52,872 INFO L146 LiptonReduction]: Number of co-enabled transitions 1716 [2021-04-29 00:39:52,877 INFO L158 LiptonReduction]: Checked pairs total: 176 [2021-04-29 00:39:52,878 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:52,878 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-04-29 00:39:52,879 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 476 flow [2021-04-29 00:39:52,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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-04-29 00:39:52,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:52,880 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:52,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:39:52,880 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash -327686121, now seen corresponding path program 1 times [2021-04-29 00:39:52,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:52,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643856067] [2021-04-29 00:39:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:52,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:52,946 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:39:52,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:39:52,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:52,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:39:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:52,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643856067] [2021-04-29 00:39:52,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:52,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:39:52,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699693691] [2021-04-29 00:39:52,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:39:52,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:52,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:39:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:39:52,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 295 [2021-04-29 00:39:52,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 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-04-29 00:39:52,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:52,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 295 [2021-04-29 00:39:52,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:39:55,666 INFO L129 PetriNetUnfolder]: 12345/21380 cut-off events. [2021-04-29 00:39:55,666 INFO L130 PetriNetUnfolder]: For 16918/27328 co-relation queries the response was YES. [2021-04-29 00:39:55,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49317 conditions, 21380 events. 12345/21380 cut-off events. For 16918/27328 co-relation queries the response was YES. Maximal size of possible extension queue 4551. Compared 217213 event pairs, 4826 based on Foata normal form. 735/6535 useless extension candidates. Maximal degree in co-relation 49292. Up to 13153 conditions per place. [2021-04-29 00:39:55,836 INFO L132 encePairwiseOnDemand]: 278/295 looper letters, 31 selfloop transitions, 27 changer transitions 2/107 dead transitions. [2021-04-29 00:39:55,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 647 flow [2021-04-29 00:39:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:39:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:39:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1069 transitions. [2021-04-29 00:39:55,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7247457627118644 [2021-04-29 00:39:55,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1069 transitions. [2021-04-29 00:39:55,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1069 transitions. [2021-04-29 00:39:55,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:39:55,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1069 transitions. [2021-04-29 00:39:55,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 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-04-29 00:39:55,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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-04-29 00:39:55,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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-04-29 00:39:55,851 INFO L185 Difference]: Start difference. First operand has 75 places, 74 transitions, 476 flow. Second operand 5 states and 1069 transitions. [2021-04-29 00:39:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 647 flow [2021-04-29 00:39:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 611 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-04-29 00:39:56,060 INFO L241 Difference]: Finished difference. Result has 79 places, 95 transitions, 625 flow [2021-04-29 00:39:56,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=625, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2021-04-29 00:39:56,060 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -45 predicate places. [2021-04-29 00:39:56,060 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:39:56,060 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 95 transitions, 625 flow [2021-04-29 00:39:56,061 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 625 flow [2021-04-29 00:39:56,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 625 flow [2021-04-29 00:39:58,087 INFO L129 PetriNetUnfolder]: 11003/19556 cut-off events. [2021-04-29 00:39:58,088 INFO L130 PetriNetUnfolder]: For 16223/51161 co-relation queries the response was YES. [2021-04-29 00:39:58,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59526 conditions, 19556 events. 11003/19556 cut-off events. For 16223/51161 co-relation queries the response was YES. Maximal size of possible extension queue 3996. Compared 201228 event pairs, 4830 based on Foata normal form. 110/6257 useless extension candidates. Maximal degree in co-relation 59500. Up to 16619 conditions per place. [2021-04-29 00:39:58,326 INFO L146 LiptonReduction]: Number of co-enabled transitions 2294 [2021-04-29 00:39:58,370 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:39:58,370 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:39:58,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2310 [2021-04-29 00:39:58,371 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 625 flow [2021-04-29 00:39:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 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-04-29 00:39:58,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:39:58,372 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:39:58,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-29 00:39:58,372 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:39:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:39:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1292677860, now seen corresponding path program 1 times [2021-04-29 00:39:58,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:39:58,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260496586] [2021-04-29 00:39:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:39:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:39:58,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:58,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:58,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:58,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:39:58,457 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:39:58,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:39:58,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:39:58,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:39:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:39:58,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260496586] [2021-04-29 00:39:58,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:39:58,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:39:58,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813590876] [2021-04-29 00:39:58,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:39:58,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:39:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:39:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:39:58,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 295 [2021-04-29 00:39:58,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 625 flow. Second operand has 5 states, 5 states have (on average 203.8) internal successors, (1019), 5 states have internal predecessors, (1019), 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-04-29 00:39:58,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:39:58,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 295 [2021-04-29 00:39:58,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:40:01,136 INFO L129 PetriNetUnfolder]: 10608/20912 cut-off events. [2021-04-29 00:40:01,136 INFO L130 PetriNetUnfolder]: For 26619/324602 co-relation queries the response was YES. [2021-04-29 00:40:01,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80898 conditions, 20912 events. 10608/20912 cut-off events. For 26619/324602 co-relation queries the response was YES. Maximal size of possible extension queue 5118. Compared 238366 event pairs, 964 based on Foata normal form. 1029/7236 useless extension candidates. Maximal degree in co-relation 80870. Up to 18008 conditions per place. [2021-04-29 00:40:01,356 INFO L132 encePairwiseOnDemand]: 278/295 looper letters, 21 selfloop transitions, 52 changer transitions 9/125 dead transitions. [2021-04-29 00:40:01,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 125 transitions, 936 flow [2021-04-29 00:40:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:40:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:40:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1499 transitions. [2021-04-29 00:40:01,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7259079903147699 [2021-04-29 00:40:01,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1499 transitions. [2021-04-29 00:40:01,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1499 transitions. [2021-04-29 00:40:01,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:40:01,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1499 transitions. [2021-04-29 00:40:01,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 214.14285714285714) internal successors, (1499), 7 states have internal predecessors, (1499), 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-04-29 00:40:01,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 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-04-29 00:40:01,375 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 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-04-29 00:40:01,375 INFO L185 Difference]: Start difference. First operand has 79 places, 95 transitions, 625 flow. Second operand 7 states and 1499 transitions. [2021-04-29 00:40:01,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 125 transitions, 936 flow [2021-04-29 00:40:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 125 transitions, 922 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-04-29 00:40:01,419 INFO L241 Difference]: Finished difference. Result has 86 places, 114 transitions, 904 flow [2021-04-29 00:40:01,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=86, PETRI_TRANSITIONS=114} [2021-04-29 00:40:01,420 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -38 predicate places. [2021-04-29 00:40:01,420 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:40:01,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 114 transitions, 904 flow [2021-04-29 00:40:01,421 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 114 transitions, 904 flow [2021-04-29 00:40:01,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 114 transitions, 904 flow [2021-04-29 00:40:03,012 INFO L129 PetriNetUnfolder]: 6788/15346 cut-off events. [2021-04-29 00:40:03,012 INFO L130 PetriNetUnfolder]: For 36388/76725 co-relation queries the response was YES. [2021-04-29 00:40:03,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67588 conditions, 15346 events. 6788/15346 cut-off events. For 36388/76725 co-relation queries the response was YES. Maximal size of possible extension queue 3873. Compared 191538 event pairs, 960 based on Foata normal form. 89/4790 useless extension candidates. Maximal degree in co-relation 67558. Up to 12896 conditions per place. [2021-04-29 00:40:03,318 INFO L146 LiptonReduction]: Number of co-enabled transitions 2566 [2021-04-29 00:40:03,342 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:40:03,342 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:40:03,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1922 [2021-04-29 00:40:03,343 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 114 transitions, 904 flow [2021-04-29 00:40:03,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 203.8) internal successors, (1019), 5 states have internal predecessors, (1019), 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-04-29 00:40:03,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:40:03,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:40:03,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-29 00:40:03,344 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:40:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:40:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash -307728722, now seen corresponding path program 1 times [2021-04-29 00:40:03,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:40:03,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145754382] [2021-04-29 00:40:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:40:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:40:03,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:03,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:40:03,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:03,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:40:03,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:03,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:40:03,448 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:40:03,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:40:03,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:03,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:40:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:40:03,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145754382] [2021-04-29 00:40:03,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:40:03,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:40:03,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242748072] [2021-04-29 00:40:03,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:40:03,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:40:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:40:03,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:40:03,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 295 [2021-04-29 00:40:03,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 114 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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-04-29 00:40:03,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:40:03,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 295 [2021-04-29 00:40:03,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:40:05,986 INFO L129 PetriNetUnfolder]: 6162/15089 cut-off events. [2021-04-29 00:40:05,986 INFO L130 PetriNetUnfolder]: For 46357/709854 co-relation queries the response was YES. [2021-04-29 00:40:06,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78932 conditions, 15089 events. 6162/15089 cut-off events. For 46357/709854 co-relation queries the response was YES. Maximal size of possible extension queue 4047. Compared 196021 event pairs, 10 based on Foata normal form. 860/4915 useless extension candidates. Maximal degree in co-relation 78900. Up to 12860 conditions per place. [2021-04-29 00:40:06,089 INFO L132 encePairwiseOnDemand]: 278/295 looper letters, 5 selfloop transitions, 67 changer transitions 19/131 dead transitions. [2021-04-29 00:40:06,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 131 transitions, 1184 flow [2021-04-29 00:40:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:40:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:40:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1911 transitions. [2021-04-29 00:40:06,099 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7197740112994351 [2021-04-29 00:40:06,100 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1911 transitions. [2021-04-29 00:40:06,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1911 transitions. [2021-04-29 00:40:06,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:40:06,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1911 transitions. [2021-04-29 00:40:06,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.33333333333334) internal successors, (1911), 9 states have internal predecessors, (1911), 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-04-29 00:40:06,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 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-04-29 00:40:06,114 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 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-04-29 00:40:06,114 INFO L185 Difference]: Start difference. First operand has 86 places, 114 transitions, 904 flow. Second operand 9 states and 1911 transitions. [2021-04-29 00:40:06,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 131 transitions, 1184 flow [2021-04-29 00:40:09,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1009 flow, removed 56 selfloop flow, removed 6 redundant places. [2021-04-29 00:40:09,049 INFO L241 Difference]: Finished difference. Result has 90 places, 110 transitions, 880 flow [2021-04-29 00:40:09,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=880, PETRI_PLACES=90, PETRI_TRANSITIONS=110} [2021-04-29 00:40:09,049 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -34 predicate places. [2021-04-29 00:40:09,049 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:40:09,049 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 110 transitions, 880 flow [2021-04-29 00:40:09,050 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 110 transitions, 880 flow [2021-04-29 00:40:09,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 110 transitions, 880 flow [2021-04-29 00:40:10,051 INFO L129 PetriNetUnfolder]: 3927/10883 cut-off events. [2021-04-29 00:40:10,052 INFO L130 PetriNetUnfolder]: For 50622/68565 co-relation queries the response was YES. [2021-04-29 00:40:10,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47334 conditions, 10883 events. 3927/10883 cut-off events. For 50622/68565 co-relation queries the response was YES. Maximal size of possible extension queue 3417. Compared 150947 event pairs, 7 based on Foata normal form. 44/3078 useless extension candidates. Maximal degree in co-relation 47303. Up to 7722 conditions per place. [2021-04-29 00:40:10,164 INFO L146 LiptonReduction]: Number of co-enabled transitions 2440 [2021-04-29 00:40:10,218 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:40:10,218 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:40:10,219 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1170 [2021-04-29 00:40:10,220 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 880 flow [2021-04-29 00:40:10,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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-04-29 00:40:10,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:40:10,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:40:10,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-29 00:40:10,221 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:40:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:40:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash 3561293, now seen corresponding path program 1 times [2021-04-29 00:40:10,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:40:10,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712839721] [2021-04-29 00:40:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:40:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:40:10,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:40:10,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:40:10,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:40:10,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:40:10,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:40:10,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:40:10,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:40:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:40:10,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712839721] [2021-04-29 00:40:10,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:40:10,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:40:10,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160881659] [2021-04-29 00:40:10,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:40:10,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:40:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:40:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:40:10,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 295 [2021-04-29 00:40:10,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 110 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 166.14285714285714) internal successors, (1163), 7 states have internal predecessors, (1163), 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-04-29 00:40:10,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:40:10,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 295 [2021-04-29 00:40:10,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:40:13,272 INFO L129 PetriNetUnfolder]: 8575/22421 cut-off events. [2021-04-29 00:40:13,273 INFO L130 PetriNetUnfolder]: For 208489/301274 co-relation queries the response was YES. [2021-04-29 00:40:13,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98798 conditions, 22421 events. 8575/22421 cut-off events. For 208489/301274 co-relation queries the response was YES. Maximal size of possible extension queue 7752. Compared 330993 event pairs, 0 based on Foata normal form. 151/5812 useless extension candidates. Maximal degree in co-relation 98765. Up to 16632 conditions per place. [2021-04-29 00:40:13,378 INFO L132 encePairwiseOnDemand]: 288/295 looper letters, 8 selfloop transitions, 10 changer transitions 24/120 dead transitions. [2021-04-29 00:40:13,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 1059 flow [2021-04-29 00:40:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:40:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:40:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-04-29 00:40:13,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5699757869249394 [2021-04-29 00:40:13,386 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-04-29 00:40:13,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-04-29 00:40:13,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:40:13,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-04-29 00:40:13,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 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-04-29 00:40:13,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 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-04-29 00:40:13,394 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 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-04-29 00:40:13,394 INFO L185 Difference]: Start difference. First operand has 88 places, 110 transitions, 880 flow. Second operand 7 states and 1177 transitions. [2021-04-29 00:40:13,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 1059 flow [2021-04-29 00:40:37,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 851 flow, removed 47 selfloop flow, removed 8 redundant places. [2021-04-29 00:40:37,910 INFO L241 Difference]: Finished difference. Result has 89 places, 95 transitions, 639 flow [2021-04-29 00:40:37,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=639, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2021-04-29 00:40:37,910 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, -35 predicate places. [2021-04-29 00:40:37,910 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:40:37,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 95 transitions, 639 flow [2021-04-29 00:40:37,910 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 95 transitions, 639 flow [2021-04-29 00:40:37,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 95 transitions, 639 flow [2021-04-29 00:40:38,081 INFO L129 PetriNetUnfolder]: 1036/2856 cut-off events. [2021-04-29 00:40:38,081 INFO L130 PetriNetUnfolder]: For 1992/2023 co-relation queries the response was YES. [2021-04-29 00:40:38,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10743 conditions, 2856 events. 1036/2856 cut-off events. For 1992/2023 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 33155 event pairs, 0 based on Foata normal form. 7/857 useless extension candidates. Maximal degree in co-relation 10712. Up to 2079 conditions per place. [2021-04-29 00:40:38,108 INFO L146 LiptonReduction]: Number of co-enabled transitions 1000 [2021-04-29 00:40:38,127 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:40:38,127 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:40:38,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-04-29 00:40:38,128 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 639 flow [2021-04-29 00:40:38,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 166.14285714285714) internal successors, (1163), 7 states have internal predecessors, (1163), 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-04-29 00:40:38,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:40:38,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:40:38,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-29 00:40:38,129 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:40:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:40:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -136241909, now seen corresponding path program 2 times [2021-04-29 00:40:38,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:40:38,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350239762] [2021-04-29 00:40:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:40:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:40:38,183 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:40:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:40:38,238 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:40:38,277 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:40:38,277 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:40:38,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-29 00:40:38,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:40:38 BasicIcfg [2021-04-29 00:40:38,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:40:38,395 INFO L168 Benchmark]: Toolchain (without parser) took 168468.43 ms. Allocated memory was 316.7 MB in the beginning and 8.0 GB in the end (delta: 7.6 GB). Free memory was 289.5 MB in the beginning and 6.3 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,395 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 316.7 MB. Free memory was 285.1 MB in the beginning and 285.0 MB in the end (delta: 66.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:40:38,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.68 ms. Allocated memory is still 316.7 MB. Free memory was 286.4 MB in the beginning and 279.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.02 ms. Allocated memory is still 316.7 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,400 INFO L168 Benchmark]: Boogie Preprocessor took 86.16 ms. Allocated memory is still 316.7 MB. Free memory was 277.5 MB in the beginning and 274.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,401 INFO L168 Benchmark]: RCFGBuilder took 2481.69 ms. Allocated memory was 316.7 MB in the beginning and 381.7 MB in the end (delta: 65.0 MB). Free memory was 274.6 MB in the beginning and 291.4 MB in the end (delta: -16.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,401 INFO L168 Benchmark]: TraceAbstraction took 164884.41 ms. Allocated memory was 381.7 MB in the beginning and 8.0 GB in the end (delta: 7.6 GB). Free memory was 290.3 MB in the beginning and 6.3 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-04-29 00:40:38,403 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.24 ms. Allocated memory is still 316.7 MB. Free memory was 285.1 MB in the beginning and 285.0 MB in the end (delta: 66.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 868.68 ms. Allocated memory is still 316.7 MB. Free memory was 286.4 MB in the beginning and 279.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.02 ms. Allocated memory is still 316.7 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 86.16 ms. Allocated memory is still 316.7 MB. Free memory was 277.5 MB in the beginning and 274.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2481.69 ms. Allocated memory was 316.7 MB in the beginning and 381.7 MB in the end (delta: 65.0 MB). Free memory was 274.6 MB in the beginning and 291.4 MB in the end (delta: -16.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 164884.41 ms. Allocated memory was 381.7 MB in the beginning and 8.0 GB in the end (delta: 7.6 GB). Free memory was 290.3 MB in the beginning and 6.3 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111689.5ms, 101 PlacesBefore, 124 PlacesAfterwards, 93 TransitionsBefore, 116 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 8 FixpointIterations, 122 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 199 TotalNumberOfCompositions, 14752 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3818, positive: 3563, positive conditional: 3563, positive unconditional: 0, negative: 255, negative conditional: 255, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1897, positive: 1825, positive conditional: 0, positive unconditional: 1825, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1897, positive: 1825, positive conditional: 0, positive unconditional: 1825, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1897, positive: 1797, positive conditional: 0, positive unconditional: 1797, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 100, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1895, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 1793, negative conditional: 0, negative unconditional: 1793, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3818, positive: 1738, positive conditional: 1738, positive unconditional: 0, negative: 183, negative conditional: 183, negative unconditional: 0, unknown: 1897, unknown conditional: 1897, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1897, Positive cache size: 1825, Positive conditional cache size: 1825, Positive unconditional cache size: 0, Negative cache size: 72, Negative conditional cache size: 72, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 378.4ms, 120 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 178, positive conditional: 178, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 52, positive conditional: 3, positive unconditional: 49, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 52, positive conditional: 3, positive unconditional: 49, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 363, negative conditional: 0, negative unconditional: 363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1959, Positive cache size: 1877, Positive conditional cache size: 1877, Positive unconditional cache size: 0, Negative cache size: 82, Negative conditional cache size: 82, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 507.5ms, 51 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 821 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 111, positive conditional: 111, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 6, positive unconditional: 16, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 6, positive unconditional: 16, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 491, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1990, Positive cache size: 1899, Positive conditional cache size: 1899, Positive unconditional cache size: 0, Negative cache size: 91, Negative conditional cache size: 91, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1022 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 723 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 107, positive conditional: 107, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2004, Positive cache size: 1911, Positive conditional cache size: 1911, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 53 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 723 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 142, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2016, Positive cache size: 1923, Positive conditional cache size: 1923, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.2ms, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 621 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 1931, Positive conditional cache size: 1931, Positive unconditional cache size: 0, Negative cache size: 95, Negative conditional cache size: 95, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.1ms, 57 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 606 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2028, Positive cache size: 1932, Positive conditional cache size: 1932, Positive unconditional cache size: 0, Negative cache size: 96, Negative conditional cache size: 96, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 129.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 2, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 2, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2038, Positive cache size: 1940, Positive conditional cache size: 1940, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.4ms, 62 PlacesBefore, 62 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2040, Positive cache size: 1942, Positive conditional cache size: 1942, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 140.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 9, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2041, Positive cache size: 1943, Positive conditional cache size: 1943, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.2ms, 71 PlacesBefore, 71 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 20, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 178.0ms, 75 PlacesBefore, 75 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 165.6ms, 75 PlacesBefore, 75 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2309.1ms, 79 PlacesBefore, 79 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 2294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1921.6ms, 86 PlacesBefore, 86 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 2566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1168.7ms, 90 PlacesBefore, 88 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 2440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 216.9ms, 89 PlacesBefore, 84 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 1946, Positive conditional cache size: 1946, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 164643.4ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 42373.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 111797.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 89 SDslu, 15 SDs, 0 SdLazy, 606 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1453.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1393.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=14, InterpolantAutomatonStates: 77, 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: 54.4ms SsaConstructionTime, 508.1ms SatisfiabilityAnalysisTime, 1869.4ms InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...