/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 20:54:42,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 20:54:42,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 20:54:42,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 20:54:42,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 20:54:42,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 20:54:42,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 20:54:42,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 20:54:42,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 20:54:42,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 20:54:42,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 20:54:42,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 20:54:42,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 20:54:42,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 20:54:42,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 20:54:42,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 20:54:42,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 20:54:42,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 20:54:42,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 20:54:42,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 20:54:42,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 20:54:42,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 20:54:42,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 20:54:42,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 20:54:42,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 20:54:42,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 20:54:42,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 20:54:42,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 20:54:42,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 20:54:42,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 20:54:42,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 20:54:42,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 20:54:42,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 20:54:42,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 20:54:42,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 20:54:42,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 20:54:42,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 20:54:42,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 20:54:42,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 20:54:42,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 20:54:42,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 20:54:42,235 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-SemanticLbe.epf [2021-06-10 20:54:42,249 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 20:54:42,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 20:54:42,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 20:54:42,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 20:54:42,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 20:54:42,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 20:54:42,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 20:54:42,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 20:54:42,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 20:54:42,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 20:54:42,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 20:54:42,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:54:42,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 20:54:42,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 20:54:42,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 20:54:42,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 20:54:42,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 20:54:42,254 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 20:54:42,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 20:54:42,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 20:54:42,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 20:54:42,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 20:54:42,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 20:54:42,498 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 20:54:42,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2021-06-10 20:54:42,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289558529/f83bcf48771e4351a57d26a4a29da54f/FLAGa28b97d7b [2021-06-10 20:54:42,952 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 20:54:42,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2021-06-10 20:54:42,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289558529/f83bcf48771e4351a57d26a4a29da54f/FLAGa28b97d7b [2021-06-10 20:54:42,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289558529/f83bcf48771e4351a57d26a4a29da54f [2021-06-10 20:54:42,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 20:54:42,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 20:54:42,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 20:54:42,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 20:54:42,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 20:54:42,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:54:42" (1/1) ... [2021-06-10 20:54:42,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57254a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:42, skipping insertion in model container [2021-06-10 20:54:42,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:54:42" (1/1) ... [2021-06-10 20:54:42,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 20:54:43,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 20:54:43,131 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/mix038_tso.oepc.i[949,962] [2021-06-10 20:54:43,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:54:43,262 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 20:54:43,268 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/mix038_tso.oepc.i[949,962] [2021-06-10 20:54:43,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:54:43,335 INFO L208 MainTranslator]: Completed translation [2021-06-10 20:54:43,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43 WrapperNode [2021-06-10 20:54:43,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 20:54:43,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 20:54:43,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 20:54:43,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 20:54:43,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 20:54:43,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 20:54:43,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 20:54:43,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 20:54:43,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... [2021-06-10 20:54:43,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 20:54:43,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 20:54:43,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 20:54:43,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 20:54:43,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:54:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 20:54:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 20:54:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 20:54:43,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 20:54:43,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 20:54:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 20:54:43,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 20:54:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 20:54:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 20:54:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 20:54:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 20:54:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 20:54:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 20:54:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 20:54:43,462 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 20:54:44,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 20:54:44,772 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 20:54:44,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:54:44 BoogieIcfgContainer [2021-06-10 20:54:44,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 20:54:44,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 20:54:44,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 20:54:44,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 20:54:44,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 08:54:42" (1/3) ... [2021-06-10 20:54:44,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456680db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:54:44, skipping insertion in model container [2021-06-10 20:54:44,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:43" (2/3) ... [2021-06-10 20:54:44,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456680db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:54:44, skipping insertion in model container [2021-06-10 20:54:44,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:54:44" (3/3) ... [2021-06-10 20:54:44,777 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2021-06-10 20:54:44,782 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 20:54:44,784 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 20:54:44,785 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 20:54:44,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,808 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:44,821 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 20:54:44,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 20:54:44,844 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 20:54:44,844 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 20:54:44,844 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 20:54:44,844 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 20:54:44,844 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 20:54:44,844 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 20:54:44,844 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 20:54:44,844 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 20:54:44,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-06-10 20:54:44,874 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-06-10 20:54:44,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:44,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-10 20:54:44,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-06-10 20:54:44,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-06-10 20:54:44,881 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 20:54:44,888 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-06-10 20:54:44,890 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-06-10 20:54:44,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-06-10 20:54:44,904 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-06-10 20:54:44,904 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:44,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-10 20:54:44,906 INFO L151 LiptonReduction]: Number of co-enabled transitions 1854 [2021-06-10 20:54:44,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:44,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:45,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:45,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:45,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:45,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:45,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:45,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:45,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:45,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:45,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:45,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:45,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:45,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:45,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,963 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 20:54:45,964 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:45,983 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:45,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,183 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 20:54:46,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:46,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:46,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,000 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 20:54:47,354 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-10 20:54:47,462 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-10 20:54:47,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:47,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 20:54:47,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:47,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,484 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-10 20:54:47,484 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:47,486 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,488 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-10 20:54:47,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:47,489 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-10 20:54:47,490 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-10 20:54:47,490 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:47,491 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,492 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-10 20:54:47,493 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-10 20:54:47,493 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:47,494 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,502 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-10 20:54:47,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:47,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:47,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:47,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:47,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:47,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:48,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:48,051 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.2 percent of original size [2021-06-10 20:54:48,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 20:54:48,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,079 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-10 20:54:48,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 20:54:48,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 20:54:48,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,095 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-10 20:54:48,097 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-10 20:54:48,097 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,101 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,102 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-10 20:54:48,103 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,104 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,105 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-10 20:54:48,105 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,106 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,108 INFO L147 QuantifierPusher]: treesize reduction 178, result has 42.4 percent of original size 131 [2021-06-10 20:54:48,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,110 INFO L142 QuantifierPusher]: treesize reduction 178, result has 57.0 percent of original size [2021-06-10 20:54:48,111 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-10 20:54:48,111 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,113 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,114 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 4, 2, 2, 1] term [2021-06-10 20:54:48,114 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,117 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,118 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 2, 2, 1] term [2021-06-10 20:54:48,118 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,120 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,123 INFO L147 QuantifierPusher]: treesize reduction 406, result has 27.9 percent of original size 157 [2021-06-10 20:54:48,123 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-10 20:54:48,123 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,125 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,128 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-10 20:54:48,128 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,131 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,132 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-10 20:54:48,132 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,133 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:48,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,144 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1 [2021-06-10 20:54:48,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-10 20:54:48,147 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-10 20:54:48,148 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,151 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,151 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 1] term [2021-06-10 20:54:48,151 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:48,154 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,157 INFO L147 QuantifierPusher]: treesize reduction 106, result has 36.5 percent of original size 61 [2021-06-10 20:54:48,165 INFO L147 QuantifierPusher]: treesize reduction 1778, result has 15.1 percent of original size 317 [2021-06-10 20:54:48,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:48,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:48,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:48,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 20:54:48,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:48,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 20:54:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 20:54:48,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:54:48,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 20:54:48,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,501 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 20:54:48,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:48,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:48,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:48,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:48,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:49,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:49,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:49,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:49,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:49,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:49,328 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-10 20:54:49,453 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-10 20:54:49,745 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-10 20:54:49,868 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-10 20:54:49,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:49,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:49,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:49,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:49,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:49,894 INFO L163 LiptonReduction]: Checked pairs total: 5760 [2021-06-10 20:54:49,895 INFO L165 LiptonReduction]: Total number of compositions: 90 [2021-06-10 20:54:49,897 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5017 [2021-06-10 20:54:49,902 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-06-10 20:54:49,902 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:49,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:49,902 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-10 20:54:49,902 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1036391641, now seen corresponding path program 1 times [2021-06-10 20:54:49,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:49,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742292080] [2021-06-10 20:54:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:50,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 20:54:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:50,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742292080] [2021-06-10 20:54:50,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:50,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:54:50,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084372864] [2021-06-10 20:54:50,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:54:50,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:54:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:54:50,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 192 [2021-06-10 20:54:50,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:50,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 192 [2021-06-10 20:54:50,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:50,068 INFO L129 PetriNetUnfolder]: 49/135 cut-off events. [2021-06-10 20:54:50,068 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:50,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 135 events. 49/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 592 event pairs, 27 based on Foata normal form. 23/137 useless extension candidates. Maximal degree in co-relation 221. Up to 65 conditions per place. [2021-06-10 20:54:50,070 INFO L132 encePairwiseOnDemand]: 187/192 looper letters, 9 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-06-10 20:54:50,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 91 flow [2021-06-10 20:54:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:54:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:54:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2021-06-10 20:54:50,079 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2021-06-10 20:54:50,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2021-06-10 20:54:50,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2021-06-10 20:54:50,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:50,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2021-06-10 20:54:50,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,089 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 496 transitions. [2021-06-10 20:54:50,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 91 flow [2021-06-10 20:54:50,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 20:54:50,092 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 62 flow [2021-06-10 20:54:50,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-06-10 20:54:50,093 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2021-06-10 20:54:50,094 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-06-10 20:54:50,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:50,094 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:50,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 20:54:50,094 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1462304568, now seen corresponding path program 1 times [2021-06-10 20:54:50,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:50,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579528277] [2021-06-10 20:54:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:50,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:50,196 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:50,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:50,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579528277] [2021-06-10 20:54:50,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:50,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:54:50,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451248585] [2021-06-10 20:54:50,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:54:50,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:54:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:54:50,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 192 [2021-06-10 20:54:50,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:50,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 192 [2021-06-10 20:54:50,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:50,242 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-06-10 20:54:50,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:50,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 49. Up to 5 conditions per place. [2021-06-10 20:54:50,243 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 2 selfloop transitions, 2 changer transitions 7/30 dead transitions. [2021-06-10 20:54:50,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 88 flow [2021-06-10 20:54:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:54:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:54:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2021-06-10 20:54:50,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8291666666666667 [2021-06-10 20:54:50,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2021-06-10 20:54:50,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2021-06-10 20:54:50,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:50,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2021-06-10 20:54:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,250 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,250 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 796 transitions. [2021-06-10 20:54:50,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 88 flow [2021-06-10 20:54:50,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:54:50,251 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 64 flow [2021-06-10 20:54:50,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-06-10 20:54:50,252 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2021-06-10 20:54:50,252 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 64 flow [2021-06-10 20:54:50,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:50,252 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:50,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 20:54:50,253 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash -461884836, now seen corresponding path program 1 times [2021-06-10 20:54:50,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:50,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927154939] [2021-06-10 20:54:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:50,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:50,335 INFO L142 QuantifierPusher]: treesize reduction 16, result has 40.7 percent of original size [2021-06-10 20:54:50,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 20:54:50,342 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:50,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:50,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927154939] [2021-06-10 20:54:50,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:50,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:54:50,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560259657] [2021-06-10 20:54:50,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:54:50,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:54:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:54:50,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 192 [2021-06-10 20:54:50,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:50,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 192 [2021-06-10 20:54:50,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:50,507 INFO L129 PetriNetUnfolder]: 110/236 cut-off events. [2021-06-10 20:54:50,507 INFO L130 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2021-06-10 20:54:50,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 236 events. 110/236 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1092 event pairs, 23 based on Foata normal form. 18/244 useless extension candidates. Maximal degree in co-relation 477. Up to 143 conditions per place. [2021-06-10 20:54:50,510 INFO L132 encePairwiseOnDemand]: 184/192 looper letters, 12 selfloop transitions, 7 changer transitions 15/48 dead transitions. [2021-06-10 20:54:50,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 186 flow [2021-06-10 20:54:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:54:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:54:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2021-06-10 20:54:50,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7306547619047619 [2021-06-10 20:54:50,512 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2021-06-10 20:54:50,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2021-06-10 20:54:50,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:50,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2021-06-10 20:54:50,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,517 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,517 INFO L185 Difference]: Start difference. First operand has 40 places, 23 transitions, 64 flow. Second operand 7 states and 982 transitions. [2021-06-10 20:54:50,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 186 flow [2021-06-10 20:54:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 178 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-10 20:54:50,520 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 119 flow [2021-06-10 20:54:50,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-06-10 20:54:50,520 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2021-06-10 20:54:50,520 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 119 flow [2021-06-10 20:54:50,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:50,521 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:50,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 20:54:50,521 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash 397230397, now seen corresponding path program 1 times [2021-06-10 20:54:50,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:50,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211902289] [2021-06-10 20:54:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:50,640 INFO L142 QuantifierPusher]: treesize reduction 39, result has 62.1 percent of original size [2021-06-10 20:54:50,642 INFO L147 QuantifierPusher]: treesize reduction 5, result has 92.2 percent of original size 59 [2021-06-10 20:54:50,682 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.7 percent of original size [2021-06-10 20:54:50,685 INFO L147 QuantifierPusher]: treesize reduction 5, result has 86.8 percent of original size 33 [2021-06-10 20:54:50,707 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.7 percent of original size [2021-06-10 20:54:50,708 INFO L147 QuantifierPusher]: treesize reduction 5, result has 86.8 percent of original size 33 [2021-06-10 20:54:50,709 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:50,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:50,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211902289] [2021-06-10 20:54:50,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:50,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:54:50,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570983185] [2021-06-10 20:54:50,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:54:50,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:54:50,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:54:50,725 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 192 [2021-06-10 20:54:50,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:50,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 192 [2021-06-10 20:54:50,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:50,842 INFO L129 PetriNetUnfolder]: 86/196 cut-off events. [2021-06-10 20:54:50,842 INFO L130 PetriNetUnfolder]: For 286/338 co-relation queries the response was YES. [2021-06-10 20:54:50,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 196 events. 86/196 cut-off events. For 286/338 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 882 event pairs, 27 based on Foata normal form. 13/201 useless extension candidates. Maximal degree in co-relation 625. Up to 113 conditions per place. [2021-06-10 20:54:50,844 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 18 selfloop transitions, 3 changer transitions 9/44 dead transitions. [2021-06-10 20:54:50,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 259 flow [2021-06-10 20:54:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:54:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:54:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2021-06-10 20:54:50,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.74375 [2021-06-10 20:54:50,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 714 transitions. [2021-06-10 20:54:50,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 714 transitions. [2021-06-10 20:54:50,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:50,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 714 transitions. [2021-06-10 20:54:50,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,849 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 119 flow. Second operand 5 states and 714 transitions. [2021-06-10 20:54:50,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 259 flow [2021-06-10 20:54:50,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 257 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 20:54:50,851 INFO L241 Difference]: Finished difference. Result has 45 places, 29 transitions, 132 flow [2021-06-10 20:54:50,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2021-06-10 20:54:50,852 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2021-06-10 20:54:50,852 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 132 flow [2021-06-10 20:54:50,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,852 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:50,852 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:50,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 20:54:50,852 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash -604481277, now seen corresponding path program 1 times [2021-06-10 20:54:50,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:50,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496788061] [2021-06-10 20:54:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:50,936 INFO L142 QuantifierPusher]: treesize reduction 21, result has 66.1 percent of original size [2021-06-10 20:54:50,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-10 20:54:50,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 20:54:50,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 20:54:50,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:50,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 20:54:50,970 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:50,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:50,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-06-10 20:54:50,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496788061] [2021-06-10 20:54:50,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:50,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:54:50,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690419925] [2021-06-10 20:54:50,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:54:50,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:54:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:54:50,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 192 [2021-06-10 20:54:50,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:50,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:50,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 192 [2021-06-10 20:54:50,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,083 INFO L129 PetriNetUnfolder]: 86/197 cut-off events. [2021-06-10 20:54:51,083 INFO L130 PetriNetUnfolder]: For 383/435 co-relation queries the response was YES. [2021-06-10 20:54:51,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 197 events. 86/197 cut-off events. For 383/435 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 875 event pairs, 19 based on Foata normal form. 11/199 useless extension candidates. Maximal degree in co-relation 663. Up to 115 conditions per place. [2021-06-10 20:54:51,085 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 15 selfloop transitions, 10 changer transitions 7/46 dead transitions. [2021-06-10 20:54:51,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 295 flow [2021-06-10 20:54:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 20:54:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 20:54:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2021-06-10 20:54:51,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7326388888888888 [2021-06-10 20:54:51,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 844 transitions. [2021-06-10 20:54:51,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 844 transitions. [2021-06-10 20:54:51,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 844 transitions. [2021-06-10 20:54:51,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,090 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,090 INFO L185 Difference]: Start difference. First operand has 45 places, 29 transitions, 132 flow. Second operand 6 states and 844 transitions. [2021-06-10 20:54:51,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 295 flow [2021-06-10 20:54:51,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 283 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-10 20:54:51,091 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 205 flow [2021-06-10 20:54:51,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-06-10 20:54:51,092 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2021-06-10 20:54:51,092 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 205 flow [2021-06-10 20:54:51,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,092 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 20:54:51,092 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 675355105, now seen corresponding path program 1 times [2021-06-10 20:54:51,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134246092] [2021-06-10 20:54:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 20:54:51,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:51,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134246092] [2021-06-10 20:54:51,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:51,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:54:51,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464291696] [2021-06-10 20:54:51,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:54:51,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:54:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:54:51,143 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 192 [2021-06-10 20:54:51,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:51,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 192 [2021-06-10 20:54:51,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,183 INFO L129 PetriNetUnfolder]: 116/279 cut-off events. [2021-06-10 20:54:51,183 INFO L130 PetriNetUnfolder]: For 511/542 co-relation queries the response was YES. [2021-06-10 20:54:51,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 279 events. 116/279 cut-off events. For 511/542 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1491 event pairs, 32 based on Foata normal form. 23/281 useless extension candidates. Maximal degree in co-relation 841. Up to 125 conditions per place. [2021-06-10 20:54:51,185 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 7 selfloop transitions, 7 changer transitions 2/45 dead transitions. [2021-06-10 20:54:51,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 257 flow [2021-06-10 20:54:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:54:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:54:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2021-06-10 20:54:51,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2021-06-10 20:54:51,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2021-06-10 20:54:51,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2021-06-10 20:54:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2021-06-10 20:54:51,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.6) internal successors, (788), 5 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,190 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,190 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 205 flow. Second operand 5 states and 788 transitions. [2021-06-10 20:54:51,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 257 flow [2021-06-10 20:54:51,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 245 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-06-10 20:54:51,192 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 247 flow [2021-06-10 20:54:51,192 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-06-10 20:54:51,192 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2021-06-10 20:54:51,192 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 247 flow [2021-06-10 20:54:51,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 20:54:51,193 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2023441806, now seen corresponding path program 1 times [2021-06-10 20:54:51,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34867803] [2021-06-10 20:54:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 20:54:51,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:51,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34867803] [2021-06-10 20:54:51,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:51,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:54:51,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016013942] [2021-06-10 20:54:51,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:54:51,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:54:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:54:51,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 192 [2021-06-10 20:54:51,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:51,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 192 [2021-06-10 20:54:51,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,286 INFO L129 PetriNetUnfolder]: 65/193 cut-off events. [2021-06-10 20:54:51,286 INFO L130 PetriNetUnfolder]: For 375/581 co-relation queries the response was YES. [2021-06-10 20:54:51,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 193 events. 65/193 cut-off events. For 375/581 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 917 event pairs, 4 based on Foata normal form. 88/270 useless extension candidates. Maximal degree in co-relation 723. Up to 106 conditions per place. [2021-06-10 20:54:51,287 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 5 selfloop transitions, 13 changer transitions 4/51 dead transitions. [2021-06-10 20:54:51,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 349 flow [2021-06-10 20:54:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:54:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:54:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1102 transitions. [2021-06-10 20:54:51,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8199404761904762 [2021-06-10 20:54:51,290 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1102 transitions. [2021-06-10 20:54:51,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1102 transitions. [2021-06-10 20:54:51,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1102 transitions. [2021-06-10 20:54:51,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.42857142857142) internal successors, (1102), 7 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,294 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,294 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 247 flow. Second operand 7 states and 1102 transitions. [2021-06-10 20:54:51,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 349 flow [2021-06-10 20:54:51,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 20:54:51,296 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 331 flow [2021-06-10 20:54:51,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2021-06-10 20:54:51,296 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2021-06-10 20:54:51,296 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 331 flow [2021-06-10 20:54:51,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,296 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,297 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 20:54:51,297 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1972388365, now seen corresponding path program 1 times [2021-06-10 20:54:51,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638797081] [2021-06-10 20:54:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:51,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,340 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:51,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:51,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638797081] [2021-06-10 20:54:51,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:51,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:54:51,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516963721] [2021-06-10 20:54:51,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:54:51,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:54:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:54:51,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 192 [2021-06-10 20:54:51,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:51,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 192 [2021-06-10 20:54:51,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,404 INFO L129 PetriNetUnfolder]: 82/292 cut-off events. [2021-06-10 20:54:51,404 INFO L130 PetriNetUnfolder]: For 953/1137 co-relation queries the response was YES. [2021-06-10 20:54:51,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 292 events. 82/292 cut-off events. For 953/1137 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1771 event pairs, 7 based on Foata normal form. 12/287 useless extension candidates. Maximal degree in co-relation 1203. Up to 150 conditions per place. [2021-06-10 20:54:51,406 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 5 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2021-06-10 20:54:51,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 367 flow [2021-06-10 20:54:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:54:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:54:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2021-06-10 20:54:51,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775 [2021-06-10 20:54:51,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2021-06-10 20:54:51,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2021-06-10 20:54:51,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2021-06-10 20:54:51,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,410 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 331 flow. Second operand 5 states and 744 transitions. [2021-06-10 20:54:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 367 flow [2021-06-10 20:54:51,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 337 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-06-10 20:54:51,416 INFO L241 Difference]: Finished difference. Result has 64 places, 48 transitions, 316 flow [2021-06-10 20:54:51,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2021-06-10 20:54:51,416 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2021-06-10 20:54:51,416 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 316 flow [2021-06-10 20:54:51,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,417 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 20:54:51,417 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -785128391, now seen corresponding path program 2 times [2021-06-10 20:54:51,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930267127] [2021-06-10 20:54:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 20:54:51,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54: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-06-10 20:54:51,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930267127] [2021-06-10 20:54:51,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:51,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:54:51,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094684867] [2021-06-10 20:54:51,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:54:51,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:54:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:54:51,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 192 [2021-06-10 20:54:51,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:51,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 192 [2021-06-10 20:54:51,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,589 INFO L129 PetriNetUnfolder]: 57/229 cut-off events. [2021-06-10 20:54:51,589 INFO L130 PetriNetUnfolder]: For 562/854 co-relation queries the response was YES. [2021-06-10 20:54:51,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 229 events. 57/229 cut-off events. For 562/854 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1384 event pairs, 0 based on Foata normal form. 163/379 useless extension candidates. Maximal degree in co-relation 918. Up to 70 conditions per place. [2021-06-10 20:54:51,591 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 2 selfloop transitions, 17 changer transitions 8/52 dead transitions. [2021-06-10 20:54:51,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 52 transitions, 392 flow [2021-06-10 20:54:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 20:54:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 20:54:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1410 transitions. [2021-06-10 20:54:51,594 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8159722222222222 [2021-06-10 20:54:51,594 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1410 transitions. [2021-06-10 20:54:51,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1410 transitions. [2021-06-10 20:54:51,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1410 transitions. [2021-06-10 20:54:51,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 156.66666666666666) internal successors, (1410), 9 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,599 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,599 INFO L185 Difference]: Start difference. First operand has 64 places, 48 transitions, 316 flow. Second operand 9 states and 1410 transitions. [2021-06-10 20:54:51,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 52 transitions, 392 flow [2021-06-10 20:54:51,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 52 transitions, 369 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-06-10 20:54:51,603 INFO L241 Difference]: Finished difference. Result has 70 places, 44 transitions, 316 flow [2021-06-10 20:54:51,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2021-06-10 20:54:51,603 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2021-06-10 20:54:51,603 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 316 flow [2021-06-10 20:54:51,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 20:54:51,604 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1523054877, now seen corresponding path program 1 times [2021-06-10 20:54:51,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047112649] [2021-06-10 20:54:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:51,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:51,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:54:51,654 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:51,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:51,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047112649] [2021-06-10 20:54:51,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:51,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:54:51,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549946768] [2021-06-10 20:54:51,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:54:51,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:54:51,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:54:51,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 192 [2021-06-10 20:54:51,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:51,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 192 [2021-06-10 20:54:51,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:51,762 INFO L129 PetriNetUnfolder]: 84/348 cut-off events. [2021-06-10 20:54:51,762 INFO L130 PetriNetUnfolder]: For 983/1061 co-relation queries the response was YES. [2021-06-10 20:54:51,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 348 events. 84/348 cut-off events. For 983/1061 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2493 event pairs, 0 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1415. Up to 116 conditions per place. [2021-06-10 20:54:51,764 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 4 selfloop transitions, 1 changer transitions 9/46 dead transitions. [2021-06-10 20:54:51,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 46 transitions, 336 flow [2021-06-10 20:54:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:54:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:54:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2021-06-10 20:54:51,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104166666666667 [2021-06-10 20:54:51,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2021-06-10 20:54:51,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2021-06-10 20:54:51,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:51,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2021-06-10 20:54:51,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,768 INFO L185 Difference]: Start difference. First operand has 70 places, 44 transitions, 316 flow. Second operand 5 states and 778 transitions. [2021-06-10 20:54:51,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 46 transitions, 336 flow [2021-06-10 20:54:51,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 46 transitions, 261 flow, removed 20 selfloop flow, removed 11 redundant places. [2021-06-10 20:54:51,775 INFO L241 Difference]: Finished difference. Result has 65 places, 37 transitions, 202 flow [2021-06-10 20:54:51,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2021-06-10 20:54:51,775 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2021-06-10 20:54:51,775 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 202 flow [2021-06-10 20:54:51,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:51,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:51,776 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:51,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 20:54:51,776 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1166524541, now seen corresponding path program 2 times [2021-06-10 20:54:51,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:51,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266291027] [2021-06-10 20:54:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:54:51,835 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-10 20:54:51,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-10 20:54:51,851 INFO L142 QuantifierPusher]: treesize reduction 22, result has 73.8 percent of original size [2021-06-10 20:54:51,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-06-10 20:54:51,881 INFO L142 QuantifierPusher]: treesize reduction 35, result has 69.3 percent of original size [2021-06-10 20:54:51,883 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.6 percent of original size 70 [2021-06-10 20:54:51,924 INFO L142 QuantifierPusher]: treesize reduction 36, result has 69.7 percent of original size [2021-06-10 20:54:51,927 INFO L147 QuantifierPusher]: treesize reduction 9, result has 89.2 percent of original size 74 [2021-06-10 20:54:51,969 INFO L142 QuantifierPusher]: treesize reduction 19, result has 71.2 percent of original size [2021-06-10 20:54:51,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 20:54:51,999 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-06-10 20:54:52,000 INFO L147 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size 14 [2021-06-10 20:54:52,017 INFO L142 QuantifierPusher]: treesize reduction 13, result has 45.8 percent of original size [2021-06-10 20:54:52,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 20:54:52,027 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 20:54:52,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 20:54:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:54:52,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266291027] [2021-06-10 20:54:52,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:54:52,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 20:54:52,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202227171] [2021-06-10 20:54:52,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 20:54:52,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:54:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 20:54:52,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-10 20:54:52,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 192 [2021-06-10 20:54:52,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 202 flow. Second operand has 10 states, 10 states have (on average 133.9) internal successors, (1339), 10 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:52,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:54:52,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 192 [2021-06-10 20:54:52,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:54:52,200 INFO L129 PetriNetUnfolder]: 32/190 cut-off events. [2021-06-10 20:54:52,200 INFO L130 PetriNetUnfolder]: For 396/445 co-relation queries the response was YES. [2021-06-10 20:54:52,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 190 events. 32/190 cut-off events. For 396/445 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1112 event pairs, 4 based on Foata normal form. 32/218 useless extension candidates. Maximal degree in co-relation 606. Up to 59 conditions per place. [2021-06-10 20:54:52,202 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 12 selfloop transitions, 6 changer transitions 5/48 dead transitions. [2021-06-10 20:54:52,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 48 transitions, 312 flow [2021-06-10 20:54:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:54:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:54:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2021-06-10 20:54:52,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7090773809523809 [2021-06-10 20:54:52,203 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2021-06-10 20:54:52,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2021-06-10 20:54:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:54:52,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2021-06-10 20:54:52,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:52,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:52,207 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:52,207 INFO L185 Difference]: Start difference. First operand has 65 places, 37 transitions, 202 flow. Second operand 7 states and 953 transitions. [2021-06-10 20:54:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 48 transitions, 312 flow [2021-06-10 20:54:52,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 278 flow, removed 11 selfloop flow, removed 9 redundant places. [2021-06-10 20:54:52,209 INFO L241 Difference]: Finished difference. Result has 63 places, 39 transitions, 221 flow [2021-06-10 20:54:52,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2021-06-10 20:54:52,210 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2021-06-10 20:54:52,210 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 221 flow [2021-06-10 20:54:52,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 133.9) internal successors, (1339), 10 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:54:52,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:54:52,210 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:54:52,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 20:54:52,210 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:54:52,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:54:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1555524877, now seen corresponding path program 3 times [2021-06-10 20:54:52,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:54:52,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062981245] [2021-06-10 20:54:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:54:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:54:52,237 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:54:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:54:52,263 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:54:52,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 20:54:52,282 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 20:54:52,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 20:54:52,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 08:54:52 BasicIcfg [2021-06-10 20:54:52,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 20:54:52,336 INFO L168 Benchmark]: Toolchain (without parser) took 9354.17 ms. Allocated memory was 371.2 MB in the beginning and 633.3 MB in the end (delta: 262.1 MB). Free memory was 333.8 MB in the beginning and 417.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 180.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 371.2 MB. Free memory is still 352.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.39 ms. Allocated memory is still 371.2 MB. Free memory was 333.6 MB in the beginning and 332.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.82 ms. Allocated memory is still 371.2 MB. Free memory was 332.2 MB in the beginning and 329.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: Boogie Preprocessor took 18.88 ms. Allocated memory is still 371.2 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: RCFGBuilder took 1384.09 ms. Allocated memory is still 371.2 MB. Free memory was 327.0 MB in the beginning and 272.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 152.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,336 INFO L168 Benchmark]: TraceAbstraction took 7561.19 ms. Allocated memory was 371.2 MB in the beginning and 633.3 MB in the end (delta: 262.1 MB). Free memory was 272.3 MB in the beginning and 417.0 MB in the end (delta: -144.7 MB). Peak memory consumption was 118.5 MB. Max. memory is 16.0 GB. [2021-06-10 20:54:52,337 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 371.2 MB. Free memory is still 352.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 350.39 ms. Allocated memory is still 371.2 MB. Free memory was 333.6 MB in the beginning and 332.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.82 ms. Allocated memory is still 371.2 MB. Free memory was 332.2 MB in the beginning and 329.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.88 ms. Allocated memory is still 371.2 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1384.09 ms. Allocated memory is still 371.2 MB. Free memory was 327.0 MB in the beginning and 272.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 152.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7561.19 ms. Allocated memory was 371.2 MB in the beginning and 633.3 MB in the end (delta: 262.1 MB). Free memory was 272.3 MB in the beginning and 417.0 MB in the end (delta: -144.7 MB). Peak memory consumption was 118.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5004.5ms, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1854 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 5760 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1950, positive: 1761, positive conditional: 0, positive unconditional: 1761, negative: 189, negative conditional: 0, negative unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, positive: 1075, positive conditional: 0, positive unconditional: 1075, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1116, positive: 1075, positive conditional: 0, positive unconditional: 1075, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1116, positive: 1057, positive conditional: 0, positive unconditional: 1057, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 601, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 571, negative conditional: 0, negative unconditional: 571, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1950, positive: 686, positive conditional: 0, positive unconditional: 686, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 1116, unknown conditional: 0, unknown unconditional: 1116] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1903, Positive conditional cache size: 0, Positive unconditional cache size: 1903, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7440.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1048.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5055.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 50 SDtfs, 46 SDslu, 47 SDs, 0 SdLazy, 315 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 313.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 552.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.5ms SsaConstructionTime, 303.7ms SatisfiabilityAnalysisTime, 841.8ms InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...