/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/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:12:02,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:12:02,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:12:02,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:12:02,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:12:02,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:12:02,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:12:02,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:12:02,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:12:02,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:12:02,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:12:02,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:12:02,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:12:02,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:12:02,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:12:02,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:12:02,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:12:02,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:12:02,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:12:02,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:12:02,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:12:02,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:12:02,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:12:02,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:12:02,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:12:02,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:12:02,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:12:02,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:12:02,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:12:02,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:12:02,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:12:02,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:12:02,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:12:02,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:12:02,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:12:02,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:12:02,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:12:02,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:12:02,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:12:02,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:12:02,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:12:02,271 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-03-11 20:12:02,305 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:12:02,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:12:02,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:12:02,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:12:02,309 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:12:02,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:12:02,309 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:12:02,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:12:02,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:12:02,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:12:02,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:12:02,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:12:02,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:12:02,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:12:02,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:12:02,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:12:02,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:12:02,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:12:02,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:12:02,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:12:02,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:12:02,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:12:02,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:12:02,314 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-03-11 20:12:02,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:12:02,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:12:02,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:12:02,673 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:12:02,674 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:12:02,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-03-11 20:12:02,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3155154ff/ebf2116c20f54b3b93f7d49f3e6d2ba9/FLAG90703a125 [2021-03-11 20:12:03,174 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:12:03,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-03-11 20:12:03,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3155154ff/ebf2116c20f54b3b93f7d49f3e6d2ba9/FLAG90703a125 [2021-03-11 20:12:03,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3155154ff/ebf2116c20f54b3b93f7d49f3e6d2ba9 [2021-03-11 20:12:03,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:12:03,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:12:03,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:12:03,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:12:03,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:12:03,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df03b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03, skipping insertion in model container [2021-03-11 20:12:03,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:12:03,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:12:03,446 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/mix047_power.opt.i[950,963] [2021-03-11 20:12:03,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:12:03,692 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:12:03,702 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/mix047_power.opt.i[950,963] [2021-03-11 20:12:03,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:12:03,830 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:12:03,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03 WrapperNode [2021-03-11 20:12:03,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:12:03,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:12:03,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:12:03,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:12:03,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:12:03,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:12:03,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:12:03,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:12:03,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... [2021-03-11 20:12:03,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:12:03,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:12:03,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:12:03,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:12:03,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:12:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:12:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:12:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:12:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:12:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:12:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:12:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:12:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:12:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:12:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:12:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:12:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:12:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:12:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:12:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:12:03,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:12:03,979 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:12:05,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:12:05,668 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:12:05,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:12:05 BoogieIcfgContainer [2021-03-11 20:12:05,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:12:05,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:12:05,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:12:05,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:12:05,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:12:03" (1/3) ... [2021-03-11 20:12:05,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a0c975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:12:05, skipping insertion in model container [2021-03-11 20:12:05,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:12:03" (2/3) ... [2021-03-11 20:12:05,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a0c975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:12:05, skipping insertion in model container [2021-03-11 20:12:05,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:12:05" (3/3) ... [2021-03-11 20:12:05,676 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2021-03-11 20:12:05,684 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:12:05,688 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:12:05,689 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,749 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,749 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,754 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,759 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:12:05,760 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:12:05,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:12:05,800 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:12:05,801 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:12:05,801 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:12:05,801 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:12:05,801 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:12:05,801 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:12:05,801 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:12:05,801 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:12:05,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-11 20:12:05,866 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-11 20:12:05,866 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:12:05,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:12:05,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-11 20:12:05,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-11 20:12:05,876 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:12:05,884 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-11 20:12:05,886 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-11 20:12:05,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-11 20:12:05,904 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-11 20:12:05,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:12:05,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:12:05,908 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-11 20:12:07,173 WARN L205 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-11 20:12:07,464 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-11 20:12:08,788 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-11 20:12:09,390 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:12:11,009 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:12:11,421 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-03-11 20:12:11,540 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:12:12,601 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 20:12:12,884 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 20:12:14,124 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-11 20:12:14,712 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 20:12:16,449 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-11 20:12:16,978 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-11 20:12:18,065 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 286 [2021-03-11 20:12:19,119 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 286 [2021-03-11 20:12:19,708 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-11 20:12:19,865 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:12:20,194 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-11 20:12:20,350 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:12:20,353 INFO L131 LiptonReduction]: Checked pairs total: 6792 [2021-03-11 20:12:20,353 INFO L133 LiptonReduction]: Total number of compositions: 97 [2021-03-11 20:12:20,355 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14480 [2021-03-11 20:12:20,366 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-11 20:12:20,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:12:20,367 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:20,367 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:20,368 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1390359357, now seen corresponding path program 1 times [2021-03-11 20:12:20,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:20,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93796814] [2021-03-11 20:12:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:20,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:20,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:20,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93796814] [2021-03-11 20:12:20,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:20,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:12:20,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287793291] [2021-03-11 20:12:20,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:20,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:20,700 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 213 [2021-03-11 20:12:20,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:20,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:20,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 213 [2021-03-11 20:12:20,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:20,849 INFO L129 PetriNetUnfolder]: 23/89 cut-off events. [2021-03-11 20:12:20,849 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:12:20,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 319 event pairs, 3 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-11 20:12:20,851 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 7 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2021-03-11 20:12:20,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 96 flow [2021-03-11 20:12:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2021-03-11 20:12:20,869 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8716744913928013 [2021-03-11 20:12:20,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2021-03-11 20:12:20,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2021-03-11 20:12:20,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:20,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2021-03-11 20:12:20,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:20,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:20,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:20,890 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 557 transitions. [2021-03-11 20:12:20,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 96 flow [2021-03-11 20:12:20,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:12:20,894 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2021-03-11 20:12:20,896 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-11 20:12:20,896 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2021-03-11 20:12:20,897 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2021-03-11 20:12:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:20,897 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:20,897 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:20,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:12:20,898 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -400426779, now seen corresponding path program 1 times [2021-03-11 20:12:20,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:20,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3904962] [2021-03-11 20:12:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3904962] [2021-03-11 20:12:21,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:12:21,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948651220] [2021-03-11 20:12:21,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:21,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:21,015 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 213 [2021-03-11 20:12:21,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 213 [2021-03-11 20:12:21,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,027 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-11 20:12:21,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:12:21,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 20:12:21,028 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-11 20:12:21,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 70 flow [2021-03-11 20:12:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2021-03-11 20:12:21,031 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8935837245696401 [2021-03-11 20:12:21,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2021-03-11 20:12:21,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2021-03-11 20:12:21,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2021-03-11 20:12:21,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,035 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 571 transitions. [2021-03-11 20:12:21,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 70 flow [2021-03-11 20:12:21,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:12:21,036 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow [2021-03-11 20:12:21,036 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-11 20:12:21,037 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2021-03-11 20:12:21,037 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow [2021-03-11 20:12:21,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,038 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:12:21,038 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1736884387, now seen corresponding path program 1 times [2021-03-11 20:12:21,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751368636] [2021-03-11 20:12:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751368636] [2021-03-11 20:12:21,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:12:21,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283907001] [2021-03-11 20:12:21,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:21,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:21,152 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-11 20:12:21,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-11 20:12:21,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,176 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-11 20:12:21,176 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-11 20:12:21,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 38 events. 3/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2021-03-11 20:12:21,177 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 3 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-11 20:12:21,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 84 flow [2021-03-11 20:12:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-11 20:12:21,182 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-11 20:12:21,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,186 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 3 states and 568 transitions. [2021-03-11 20:12:21,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 84 flow [2021-03-11 20:12:21,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:12:21,187 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 83 flow [2021-03-11 20:12:21,188 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-03-11 20:12:21,188 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2021-03-11 20:12:21,188 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 83 flow [2021-03-11 20:12:21,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,189 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,189 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:12:21,189 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1991159750, now seen corresponding path program 1 times [2021-03-11 20:12:21,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516036132] [2021-03-11 20:12:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,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-03-11 20:12:21,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516036132] [2021-03-11 20:12:21,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:12:21,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598279851] [2021-03-11 20:12:21,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:21,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:21,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:21,239 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-11 20:12:21,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-11 20:12:21,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,258 INFO L129 PetriNetUnfolder]: 10/59 cut-off events. [2021-03-11 20:12:21,258 INFO L130 PetriNetUnfolder]: For 21/30 co-relation queries the response was YES. [2021-03-11 20:12:21,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 59 events. 10/59 cut-off events. For 21/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 3 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 106. Up to 19 conditions per place. [2021-03-11 20:12:21,259 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-11 20:12:21,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 99 flow [2021-03-11 20:12:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-11 20:12:21,262 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-11 20:12:21,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-11 20:12:21,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,266 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 83 flow. Second operand 3 states and 568 transitions. [2021-03-11 20:12:21,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 99 flow [2021-03-11 20:12:21,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:21,267 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 99 flow [2021-03-11 20:12:21,267 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-11 20:12:21,268 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2021-03-11 20:12:21,268 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 99 flow [2021-03-11 20:12:21,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,268 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,268 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:12:21,269 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1071535379, now seen corresponding path program 1 times [2021-03-11 20:12:21,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723895626] [2021-03-11 20:12:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:21,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723895626] [2021-03-11 20:12:21,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:12:21,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444072674] [2021-03-11 20:12:21,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:21,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:21,355 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-11 20:12:21,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-11 20:12:21,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,378 INFO L129 PetriNetUnfolder]: 4/53 cut-off events. [2021-03-11 20:12:21,379 INFO L130 PetriNetUnfolder]: For 62/115 co-relation queries the response was YES. [2021-03-11 20:12:21,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 53 events. 4/53 cut-off events. For 62/115 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 175 event pairs, 1 based on Foata normal form. 4/53 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2021-03-11 20:12:21,381 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-11 20:12:21,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 111 flow [2021-03-11 20:12:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-03-11 20:12:21,383 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8873239436619719 [2021-03-11 20:12:21,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,387 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 99 flow. Second operand 3 states and 567 transitions. [2021-03-11 20:12:21,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 111 flow [2021-03-11 20:12:21,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:21,391 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 107 flow [2021-03-11 20:12:21,391 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-11 20:12:21,391 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2021-03-11 20:12:21,391 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 107 flow [2021-03-11 20:12:21,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,392 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:12:21,392 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1596411098, now seen corresponding path program 1 times [2021-03-11 20:12:21,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293903419] [2021-03-11 20:12:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,499 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:12:21,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:12:21,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:21,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293903419] [2021-03-11 20:12:21,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:12:21,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905418311] [2021-03-11 20:12:21,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:12:21,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:12:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:12:21,556 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213 [2021-03-11 20:12:21,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213 [2021-03-11 20:12:21,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,653 INFO L129 PetriNetUnfolder]: 80/239 cut-off events. [2021-03-11 20:12:21,653 INFO L130 PetriNetUnfolder]: For 415/510 co-relation queries the response was YES. [2021-03-11 20:12:21,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 239 events. 80/239 cut-off events. For 415/510 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1282 event pairs, 33 based on Foata normal form. 3/219 useless extension candidates. Maximal degree in co-relation 541. Up to 127 conditions per place. [2021-03-11 20:12:21,656 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 8 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2021-03-11 20:12:21,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 145 flow [2021-03-11 20:12:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:12:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:12:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-11 20:12:21,659 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7910798122065728 [2021-03-11 20:12:21,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-11 20:12:21,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-11 20:12:21,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-11 20:12:21,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,663 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,663 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 107 flow. Second operand 4 states and 674 transitions. [2021-03-11 20:12:21,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 145 flow [2021-03-11 20:12:21,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 140 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:21,667 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 134 flow [2021-03-11 20:12:21,667 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-11 20:12:21,667 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2021-03-11 20:12:21,667 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 134 flow [2021-03-11 20:12:21,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,668 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,668 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:12:21,668 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2101710940, now seen corresponding path program 1 times [2021-03-11 20:12:21,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187152631] [2021-03-11 20:12:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:21,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187152631] [2021-03-11 20:12:21,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:12:21,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138293680] [2021-03-11 20:12:21,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:12:21,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:12:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:12:21,761 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 213 [2021-03-11 20:12:21,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 213 [2021-03-11 20:12:21,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,856 INFO L129 PetriNetUnfolder]: 108/295 cut-off events. [2021-03-11 20:12:21,856 INFO L130 PetriNetUnfolder]: For 609/687 co-relation queries the response was YES. [2021-03-11 20:12:21,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 295 events. 108/295 cut-off events. For 609/687 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1647 event pairs, 23 based on Foata normal form. 10/278 useless extension candidates. Maximal degree in co-relation 807. Up to 150 conditions per place. [2021-03-11 20:12:21,860 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 8 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2021-03-11 20:12:21,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 204 flow [2021-03-11 20:12:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:12:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:12:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 881 transitions. [2021-03-11 20:12:21,863 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8272300469483568 [2021-03-11 20:12:21,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 881 transitions. [2021-03-11 20:12:21,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 881 transitions. [2021-03-11 20:12:21,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 881 transitions. [2021-03-11 20:12:21,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.2) internal successors, (881), 5 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,867 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,868 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 134 flow. Second operand 5 states and 881 transitions. [2021-03-11 20:12:21,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 204 flow [2021-03-11 20:12:21,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:12:21,871 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 209 flow [2021-03-11 20:12:21,872 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-03-11 20:12:21,872 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2021-03-11 20:12:21,872 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 209 flow [2021-03-11 20:12:21,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:12:21,873 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash -848877989, now seen corresponding path program 1 times [2021-03-11 20:12:21,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649621979] [2021-03-11 20:12:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:21,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:21,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:21,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:21,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649621979] [2021-03-11 20:12:21,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:21,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:12:21,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608825838] [2021-03-11 20:12:21,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:12:21,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:12:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:12:21,924 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-11 20:12:21,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:21,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-11 20:12:21,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:21,980 INFO L129 PetriNetUnfolder]: 71/270 cut-off events. [2021-03-11 20:12:21,980 INFO L130 PetriNetUnfolder]: For 1553/1813 co-relation queries the response was YES. [2021-03-11 20:12:21,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 270 events. 71/270 cut-off events. For 1553/1813 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1681 event pairs, 13 based on Foata normal form. 17/266 useless extension candidates. Maximal degree in co-relation 832. Up to 91 conditions per place. [2021-03-11 20:12:21,983 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 4 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2021-03-11 20:12:21,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 41 transitions, 223 flow [2021-03-11 20:12:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:12:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:12:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-03-11 20:12:21,986 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8873239436619719 [2021-03-11 20:12:21,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-03-11 20:12:21,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,989 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 209 flow. Second operand 3 states and 567 transitions. [2021-03-11 20:12:21,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 41 transitions, 223 flow [2021-03-11 20:12:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 214 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:21,994 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 213 flow [2021-03-11 20:12:21,994 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-11 20:12:21,995 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2021-03-11 20:12:21,995 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 213 flow [2021-03-11 20:12:21,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:21,995 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:21,995 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:21,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:12:21,995 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1734687869, now seen corresponding path program 1 times [2021-03-11 20:12:21,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:21,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553553382] [2021-03-11 20:12:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:22,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:22,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:22,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:22,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:22,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553553382] [2021-03-11 20:12:22,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:22,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:12:22,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974088992] [2021-03-11 20:12:22,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:12:22,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:22,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:12:22,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:12:22,069 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 213 [2021-03-11 20:12:22,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:22,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 213 [2021-03-11 20:12:22,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:22,151 INFO L129 PetriNetUnfolder]: 74/269 cut-off events. [2021-03-11 20:12:22,152 INFO L130 PetriNetUnfolder]: For 1441/1580 co-relation queries the response was YES. [2021-03-11 20:12:22,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 269 events. 74/269 cut-off events. For 1441/1580 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1602 event pairs, 18 based on Foata normal form. 27/279 useless extension candidates. Maximal degree in co-relation 880. Up to 114 conditions per place. [2021-03-11 20:12:22,156 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 11 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2021-03-11 20:12:22,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 44 transitions, 260 flow [2021-03-11 20:12:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:12:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:12:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 704 transitions. [2021-03-11 20:12:22,158 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8262910798122066 [2021-03-11 20:12:22,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 704 transitions. [2021-03-11 20:12:22,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 704 transitions. [2021-03-11 20:12:22,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:22,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 704 transitions. [2021-03-11 20:12:22,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,164 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 213 flow. Second operand 4 states and 704 transitions. [2021-03-11 20:12:22,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 44 transitions, 260 flow [2021-03-11 20:12:22,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 44 transitions, 255 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:22,168 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 238 flow [2021-03-11 20:12:22,168 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2021-03-11 20:12:22,168 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2021-03-11 20:12:22,168 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 238 flow [2021-03-11 20:12:22,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,169 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:22,169 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:22,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:12:22,169 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1834279019, now seen corresponding path program 1 times [2021-03-11 20:12:22,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:22,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101242254] [2021-03-11 20:12:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:22,260 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:12:22,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:12:22,288 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:12:22,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:12:22,291 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-11 20:12:22,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-11 20:12:22,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:22,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:22,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101242254] [2021-03-11 20:12:22,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:22,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:12:22,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454514499] [2021-03-11 20:12:22,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:12:22,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:12:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:12:22,348 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2021-03-11 20:12:22,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:22,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2021-03-11 20:12:22,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:22,462 INFO L129 PetriNetUnfolder]: 80/290 cut-off events. [2021-03-11 20:12:22,463 INFO L130 PetriNetUnfolder]: For 1385/1501 co-relation queries the response was YES. [2021-03-11 20:12:22,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 290 events. 80/290 cut-off events. For 1385/1501 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1758 event pairs, 0 based on Foata normal form. 25/299 useless extension candidates. Maximal degree in co-relation 1130. Up to 141 conditions per place. [2021-03-11 20:12:22,466 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 17 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-03-11 20:12:22,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 358 flow [2021-03-11 20:12:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:12:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:12:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2021-03-11 20:12:22,469 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7718309859154929 [2021-03-11 20:12:22,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2021-03-11 20:12:22,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2021-03-11 20:12:22,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:22,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2021-03-11 20:12:22,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 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-03-11 20:12:22,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,473 INFO L185 Difference]: Start difference. First operand has 58 places, 42 transitions, 238 flow. Second operand 5 states and 822 transitions. [2021-03-11 20:12:22,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 358 flow [2021-03-11 20:12:22,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 334 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:12:22,477 INFO L241 Difference]: Finished difference. Result has 61 places, 49 transitions, 308 flow [2021-03-11 20:12:22,477 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2021-03-11 20:12:22,477 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2021-03-11 20:12:22,478 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 308 flow [2021-03-11 20:12:22,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,478 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:22,478 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:22,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:12:22,478 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2010759471, now seen corresponding path program 2 times [2021-03-11 20:12:22,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:22,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672653250] [2021-03-11 20:12:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:22,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:12:22,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:12:22,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:12:22,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:12:22,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:22,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:12:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:22,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672653250] [2021-03-11 20:12:22,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:22,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:12:22,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342572838] [2021-03-11 20:12:22,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:12:22,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:12:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:12:22,634 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 213 [2021-03-11 20:12:22,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:22,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 213 [2021-03-11 20:12:22,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:22,796 INFO L129 PetriNetUnfolder]: 80/296 cut-off events. [2021-03-11 20:12:22,796 INFO L130 PetriNetUnfolder]: For 1394/1579 co-relation queries the response was YES. [2021-03-11 20:12:22,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 296 events. 80/296 cut-off events. For 1394/1579 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1828 event pairs, 0 based on Foata normal form. 67/347 useless extension candidates. Maximal degree in co-relation 1216. Up to 120 conditions per place. [2021-03-11 20:12:22,800 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 15 selfloop transitions, 20 changer transitions 0/58 dead transitions. [2021-03-11 20:12:22,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 445 flow [2021-03-11 20:12:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:12:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:12:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2021-03-11 20:12:22,803 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7812206572769953 [2021-03-11 20:12:22,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2021-03-11 20:12:22,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2021-03-11 20:12:22,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:22,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2021-03-11 20:12:22,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,807 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 308 flow. Second operand 5 states and 832 transitions. [2021-03-11 20:12:22,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 445 flow [2021-03-11 20:12:22,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 431 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:22,810 INFO L241 Difference]: Finished difference. Result has 65 places, 55 transitions, 402 flow [2021-03-11 20:12:22,811 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2021-03-11 20:12:22,811 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2021-03-11 20:12:22,811 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 402 flow [2021-03-11 20:12:22,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:22,812 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:22,812 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:22,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:12:22,813 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1932425057, now seen corresponding path program 3 times [2021-03-11 20:12:22,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:22,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964200543] [2021-03-11 20:12:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:22,896 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-11 20:12:22,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:12:22,926 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-11 20:12:22,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:12:22,929 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:12:22,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:12:22,961 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-11 20:12:22,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-11 20:12:23,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:23,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:12:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:23,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964200543] [2021-03-11 20:12:23,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:23,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:12:23,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871415758] [2021-03-11 20:12:23,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:12:23,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:12:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:12:23,021 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2021-03-11 20:12:23,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:23,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2021-03-11 20:12:23,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:23,189 INFO L129 PetriNetUnfolder]: 86/317 cut-off events. [2021-03-11 20:12:23,189 INFO L130 PetriNetUnfolder]: For 1803/2004 co-relation queries the response was YES. [2021-03-11 20:12:23,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 317 events. 86/317 cut-off events. For 1803/2004 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2033 event pairs, 0 based on Foata normal form. 85/386 useless extension candidates. Maximal degree in co-relation 1433. Up to 132 conditions per place. [2021-03-11 20:12:23,193 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 18 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2021-03-11 20:12:23,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 537 flow [2021-03-11 20:12:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:12:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:12:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1149 transitions. [2021-03-11 20:12:23,196 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7706237424547284 [2021-03-11 20:12:23,196 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1149 transitions. [2021-03-11 20:12:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1149 transitions. [2021-03-11 20:12:23,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:23,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1149 transitions. [2021-03-11 20:12:23,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.14285714285714) internal successors, (1149), 7 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,202 INFO L185 Difference]: Start difference. First operand has 65 places, 55 transitions, 402 flow. Second operand 7 states and 1149 transitions. [2021-03-11 20:12:23,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 537 flow [2021-03-11 20:12:23,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 529 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-11 20:12:23,207 INFO L241 Difference]: Finished difference. Result has 72 places, 58 transitions, 480 flow [2021-03-11 20:12:23,207 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=480, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2021-03-11 20:12:23,207 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2021-03-11 20:12:23,207 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 480 flow [2021-03-11 20:12:23,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,208 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:23,208 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:23,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:12:23,208 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2136545729, now seen corresponding path program 4 times [2021-03-11 20:12:23,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:23,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558992672] [2021-03-11 20:12:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:23,273 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-11 20:12:23,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-11 20:12:23,300 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-11 20:12:23,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-11 20:12:23,305 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-11 20:12:23,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 20:12:23,338 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-11 20:12:23,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 20:12:23,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:23,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:12:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:23,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558992672] [2021-03-11 20:12:23,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:23,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:12:23,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880032689] [2021-03-11 20:12:23,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:12:23,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:23,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:12:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:12:23,395 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2021-03-11 20:12:23,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:23,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2021-03-11 20:12:23,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:23,564 INFO L129 PetriNetUnfolder]: 75/314 cut-off events. [2021-03-11 20:12:23,564 INFO L130 PetriNetUnfolder]: For 2045/2272 co-relation queries the response was YES. [2021-03-11 20:12:23,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 314 events. 75/314 cut-off events. For 2045/2272 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2094 event pairs, 0 based on Foata normal form. 112/411 useless extension candidates. Maximal degree in co-relation 1468. Up to 108 conditions per place. [2021-03-11 20:12:23,568 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 10 selfloop transitions, 27 changer transitions 1/61 dead transitions. [2021-03-11 20:12:23,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 61 transitions, 576 flow [2021-03-11 20:12:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:12:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:12:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2021-03-11 20:12:23,571 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7679409792085848 [2021-03-11 20:12:23,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2021-03-11 20:12:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2021-03-11 20:12:23,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:23,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2021-03-11 20:12:23,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,576 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,576 INFO L185 Difference]: Start difference. First operand has 72 places, 58 transitions, 480 flow. Second operand 7 states and 1145 transitions. [2021-03-11 20:12:23,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 61 transitions, 576 flow [2021-03-11 20:12:23,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 61 transitions, 544 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-03-11 20:12:23,583 INFO L241 Difference]: Finished difference. Result has 74 places, 57 transitions, 511 flow [2021-03-11 20:12:23,583 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=511, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2021-03-11 20:12:23,583 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2021-03-11 20:12:23,583 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 511 flow [2021-03-11 20:12:23,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:23,584 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:23,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:12:23,584 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -851402815, now seen corresponding path program 1 times [2021-03-11 20:12:23,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:23,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257096332] [2021-03-11 20:12:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:23,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:23,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:23,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:23,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:23,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:23,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:23,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257096332] [2021-03-11 20:12:23,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:23,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:12:23,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722251152] [2021-03-11 20:12:23,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:12:23,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:12:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:12:23,660 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 213 [2021-03-11 20:12:23,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:23,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:23,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 213 [2021-03-11 20:12:23,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:24,052 INFO L129 PetriNetUnfolder]: 1460/2636 cut-off events. [2021-03-11 20:12:24,052 INFO L130 PetriNetUnfolder]: For 9143/11263 co-relation queries the response was YES. [2021-03-11 20:12:24,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8725 conditions, 2636 events. 1460/2636 cut-off events. For 9143/11263 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 20318 event pairs, 686 based on Foata normal form. 449/2621 useless extension candidates. Maximal degree in co-relation 8696. Up to 1684 conditions per place. [2021-03-11 20:12:24,077 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 14 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2021-03-11 20:12:24,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 585 flow [2021-03-11 20:12:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:12:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:12:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 892 transitions. [2021-03-11 20:12:24,080 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8375586854460094 [2021-03-11 20:12:24,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 892 transitions. [2021-03-11 20:12:24,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 892 transitions. [2021-03-11 20:12:24,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:24,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 892 transitions. [2021-03-11 20:12:24,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,084 INFO L185 Difference]: Start difference. First operand has 74 places, 57 transitions, 511 flow. Second operand 5 states and 892 transitions. [2021-03-11 20:12:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 585 flow [2021-03-11 20:12:24,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 534 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-11 20:12:24,102 INFO L241 Difference]: Finished difference. Result has 76 places, 66 transitions, 551 flow [2021-03-11 20:12:24,103 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2021-03-11 20:12:24,103 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2021-03-11 20:12:24,103 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 551 flow [2021-03-11 20:12:24,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,103 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:24,103 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:24,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:12:24,103 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash 843596352, now seen corresponding path program 1 times [2021-03-11 20:12:24,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:24,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704269546] [2021-03-11 20:12:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:24,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:24,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:24,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:24,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:24,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704269546] [2021-03-11 20:12:24,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:24,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:12:24,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249686194] [2021-03-11 20:12:24,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:12:24,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:24,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:12:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:12:24,180 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 213 [2021-03-11 20:12:24,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:24,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 213 [2021-03-11 20:12:24,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:24,492 INFO L129 PetriNetUnfolder]: 1053/2016 cut-off events. [2021-03-11 20:12:24,492 INFO L130 PetriNetUnfolder]: For 9713/18491 co-relation queries the response was YES. [2021-03-11 20:12:24,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 2016 events. 1053/2016 cut-off events. For 9713/18491 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 15415 event pairs, 198 based on Foata normal form. 630/2296 useless extension candidates. Maximal degree in co-relation 8979. Up to 1517 conditions per place. [2021-03-11 20:12:24,512 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 14 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2021-03-11 20:12:24,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 693 flow [2021-03-11 20:12:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:12:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:12:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions. [2021-03-11 20:12:24,516 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8376928236083165 [2021-03-11 20:12:24,516 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions. [2021-03-11 20:12:24,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions. [2021-03-11 20:12:24,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:24,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions. [2021-03-11 20:12:24,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.42857142857142) internal successors, (1249), 7 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,534 INFO L185 Difference]: Start difference. First operand has 76 places, 66 transitions, 551 flow. Second operand 7 states and 1249 transitions. [2021-03-11 20:12:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 693 flow [2021-03-11 20:12:24,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:12:24,551 INFO L241 Difference]: Finished difference. Result has 84 places, 75 transitions, 696 flow [2021-03-11 20:12:24,551 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=696, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2021-03-11 20:12:24,551 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2021-03-11 20:12:24,552 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 696 flow [2021-03-11 20:12:24,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,552 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:24,552 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:12:24,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:12:24,552 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash -558026086, now seen corresponding path program 1 times [2021-03-11 20:12:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:24,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994117534] [2021-03-11 20:12:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:24,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:24,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:24,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:24,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:24,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:24,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:24,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994117534] [2021-03-11 20:12:24,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:24,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:12:24,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929658908] [2021-03-11 20:12:24,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:12:24,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:12:24,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:12:24,629 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 213 [2021-03-11 20:12:24,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 696 flow. Second operand has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:24,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 213 [2021-03-11 20:12:24,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:24,947 INFO L129 PetriNetUnfolder]: 737/1486 cut-off events. [2021-03-11 20:12:24,947 INFO L130 PetriNetUnfolder]: For 11909/25722 co-relation queries the response was YES. [2021-03-11 20:12:24,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 1486 events. 737/1486 cut-off events. For 11909/25722 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 11072 event pairs, 20 based on Foata normal form. 766/1951 useless extension candidates. Maximal degree in co-relation 8660. Up to 1275 conditions per place. [2021-03-11 20:12:24,962 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 8 selfloop transitions, 28 changer transitions 5/79 dead transitions. [2021-03-11 20:12:24,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 79 transitions, 792 flow [2021-03-11 20:12:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:12:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:12:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1606 transitions. [2021-03-11 20:12:24,966 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8377673448095984 [2021-03-11 20:12:24,966 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1606 transitions. [2021-03-11 20:12:24,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1606 transitions. [2021-03-11 20:12:24,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:24,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1606 transitions. [2021-03-11 20:12:24,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 178.44444444444446) internal successors, (1606), 9 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,974 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:24,974 INFO L185 Difference]: Start difference. First operand has 84 places, 75 transitions, 696 flow. Second operand 9 states and 1606 transitions. [2021-03-11 20:12:24,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 79 transitions, 792 flow [2021-03-11 20:12:24,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 79 transitions, 737 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-03-11 20:12:24,999 INFO L241 Difference]: Finished difference. Result has 91 places, 74 transitions, 700 flow [2021-03-11 20:12:24,999 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=700, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2021-03-11 20:12:24,999 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2021-03-11 20:12:24,999 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 700 flow [2021-03-11 20:12:24,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,000 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:25,000 INFO L255 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-03-11 20:12:25,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:12:25,000 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash 137304029, now seen corresponding path program 1 times [2021-03-11 20:12:25,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:25,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475055641] [2021-03-11 20:12:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:25,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:12:25,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:25,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475055641] [2021-03-11 20:12:25,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:25,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:12:25,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182839757] [2021-03-11 20:12:25,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:12:25,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:12:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:12:25,097 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 213 [2021-03-11 20:12:25,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:25,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 213 [2021-03-11 20:12:25,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:25,390 INFO L129 PetriNetUnfolder]: 604/1258 cut-off events. [2021-03-11 20:12:25,391 INFO L130 PetriNetUnfolder]: For 14251/27537 co-relation queries the response was YES. [2021-03-11 20:12:25,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 1258 events. 604/1258 cut-off events. For 14251/27537 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 9273 event pairs, 0 based on Foata normal form. 668/1632 useless extension candidates. Maximal degree in co-relation 7951. Up to 862 conditions per place. [2021-03-11 20:12:25,403 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 2 selfloop transitions, 33 changer transitions 8/75 dead transitions. [2021-03-11 20:12:25,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 75 transitions, 779 flow [2021-03-11 20:12:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:12:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:12:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1955 transitions. [2021-03-11 20:12:25,409 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.834400341442595 [2021-03-11 20:12:25,409 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1955 transitions. [2021-03-11 20:12:25,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1955 transitions. [2021-03-11 20:12:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:25,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1955 transitions. [2021-03-11 20:12:25,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 177.72727272727272) internal successors, (1955), 11 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,417 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,417 INFO L185 Difference]: Start difference. First operand has 91 places, 74 transitions, 700 flow. Second operand 11 states and 1955 transitions. [2021-03-11 20:12:25,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 75 transitions, 779 flow [2021-03-11 20:12:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 75 transitions, 651 flow, removed 44 selfloop flow, removed 8 redundant places. [2021-03-11 20:12:25,485 INFO L241 Difference]: Finished difference. Result has 96 places, 67 transitions, 591 flow [2021-03-11 20:12:25,485 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=591, PETRI_PLACES=96, PETRI_TRANSITIONS=67} [2021-03-11 20:12:25,486 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2021-03-11 20:12:25,486 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 591 flow [2021-03-11 20:12:25,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,486 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:25,486 INFO L255 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, 1, 1, 1] [2021-03-11 20:12:25,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:12:25,486 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1694474619, now seen corresponding path program 1 times [2021-03-11 20:12:25,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:25,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856334387] [2021-03-11 20:12:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:12:25,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:12:25,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:12:25,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:12:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:12:25,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856334387] [2021-03-11 20:12:25,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:12:25,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:12:25,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869377672] [2021-03-11 20:12:25,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:12:25,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:12:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:12:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:12:25,559 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 213 [2021-03-11 20:12:25,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 67 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 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-03-11 20:12:25,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:12:25,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 213 [2021-03-11 20:12:25,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:12:25,637 INFO L129 PetriNetUnfolder]: 267/594 cut-off events. [2021-03-11 20:12:25,638 INFO L130 PetriNetUnfolder]: For 2967/3686 co-relation queries the response was YES. [2021-03-11 20:12:25,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 594 events. 267/594 cut-off events. For 2967/3686 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 3760 event pairs, 0 based on Foata normal form. 13/520 useless extension candidates. Maximal degree in co-relation 2639. Up to 200 conditions per place. [2021-03-11 20:12:25,642 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 1 changer transitions 12/68 dead transitions. [2021-03-11 20:12:25,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 68 transitions, 603 flow [2021-03-11 20:12:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:12:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:12:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-11 20:12:25,645 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8755868544600939 [2021-03-11 20:12:25,645 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-11 20:12:25,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-11 20:12:25,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:12:25,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-11 20:12:25,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:12:25,648 INFO L185 Difference]: Start difference. First operand has 96 places, 67 transitions, 591 flow. Second operand 4 states and 746 transitions. [2021-03-11 20:12:25,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 68 transitions, 603 flow [2021-03-11 20:12:25,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 68 transitions, 465 flow, removed 28 selfloop flow, removed 17 redundant places. [2021-03-11 20:12:25,665 INFO L241 Difference]: Finished difference. Result has 83 places, 56 transitions, 356 flow [2021-03-11 20:12:25,665 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=83, PETRI_TRANSITIONS=56} [2021-03-11 20:12:25,665 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2021-03-11 20:12:25,665 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 56 transitions, 356 flow [2021-03-11 20:12:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 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-03-11 20:12:25,666 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:12:25,666 INFO L255 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, 1, 1, 1] [2021-03-11 20:12:25,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 20:12:25,666 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:12:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:12:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -500510297, now seen corresponding path program 2 times [2021-03-11 20:12:25,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:12:25,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982394058] [2021-03-11 20:12:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:12:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:12:25,713 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:12:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:12:25,761 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:12:25,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:12:25,804 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:12:25,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 20:12:25,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:12:25 BasicIcfg [2021-03-11 20:12:25,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:12:25,899 INFO L168 Benchmark]: Toolchain (without parser) took 22696.07 ms. Allocated memory was 255.9 MB in the beginning and 620.8 MB in the end (delta: 364.9 MB). Free memory was 234.5 MB in the beginning and 312.8 MB in the end (delta: -78.3 MB). Peak memory consumption was 285.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,899 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:12:25,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.52 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 233.9 MB in the beginning and 303.5 MB in the end (delta: -69.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.25 ms. Allocated memory is still 343.9 MB. Free memory was 302.8 MB in the beginning and 300.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,900 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 343.9 MB. Free memory was 300.0 MB in the beginning and 297.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,900 INFO L168 Benchmark]: RCFGBuilder took 1749.39 ms. Allocated memory is still 343.9 MB. Free memory was 297.9 MB in the beginning and 217.7 MB in the end (delta: 80.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,900 INFO L168 Benchmark]: TraceAbstraction took 20227.23 ms. Allocated memory was 343.9 MB in the beginning and 620.8 MB in the end (delta: 276.8 MB). Free memory was 216.6 MB in the beginning and 312.8 MB in the end (delta: -96.2 MB). Peak memory consumption was 179.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:12:25,902 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.18 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 615.52 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 233.9 MB in the beginning and 303.5 MB in the end (delta: -69.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.25 ms. Allocated memory is still 343.9 MB. Free memory was 302.8 MB in the beginning and 300.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.10 ms. Allocated memory is still 343.9 MB. Free memory was 300.0 MB in the beginning and 297.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1749.39 ms. Allocated memory is still 343.9 MB. Free memory was 297.9 MB in the beginning and 217.7 MB in the end (delta: 80.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20227.23 ms. Allocated memory was 343.9 MB in the beginning and 620.8 MB in the end (delta: 276.8 MB). Free memory was 216.6 MB in the beginning and 312.8 MB in the end (delta: -96.2 MB). Peak memory consumption was 179.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14467.4ms, 123 PlacesBefore, 41 PlacesAfterwards, 112 TransitionsBefore, 29 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 6792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3240, positive: 3036, positive conditional: 0, positive unconditional: 3036, negative: 204, negative conditional: 0, negative unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1779, positive: 1724, positive conditional: 0, positive unconditional: 1724, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1779, positive: 1686, positive conditional: 0, positive unconditional: 1686, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1178, positive: 225, positive conditional: 0, positive unconditional: 225, negative: 953, negative conditional: 0, negative unconditional: 953, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3240, positive: 1312, positive conditional: 0, positive unconditional: 1312, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 1779, unknown conditional: 0, unknown unconditional: 1779] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20009.3ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3100.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14561.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 43 SDslu, 22 SDs, 0 SdLazy, 362 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 491.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 738.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=16, InterpolantAutomatonStates: 91, 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: 59.2ms SsaConstructionTime, 590.2ms SatisfiabilityAnalysisTime, 1349.9ms InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 2033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...