/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:58:27,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:58:27,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:58:27,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:58:27,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:58:27,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:58:27,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:58:27,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:58:27,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:58:27,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:58:27,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:58:27,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:58:27,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:58:27,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:58:27,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:58:27,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:58:27,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:58:27,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:58:27,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:58:27,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:58:27,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:58:27,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:58:27,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:58:27,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:58:27,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:58:27,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:58:27,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:58:27,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:58:27,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:58:27,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:58:27,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:58:27,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:58:27,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:58:27,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:58:27,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:58:27,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:58:27,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:58:27,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:58:27,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:58:27,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:58:27,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:58:27,853 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-RepeatedSemanticLbe.epf [2021-06-11 06:58:27,878 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:58:27,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:58:27,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:58:27,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:58:27,880 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:58:27,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:58:27,880 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:58:27,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:58:27,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:58:27,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:58:27,882 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:58:27,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:58:27,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:58:27,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:58:27,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:58:27,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:58:27,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:58:27,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:58:27,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:58:27,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:58:27,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:58:27,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:58:27,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:58:27,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:58:27,884 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 06:58:28,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:58:28,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:58:28,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:58:28,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:58:28,185 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:58:28,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-06-11 06:58:28,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3941909/b5ee0ea071ee40e1861bbc3e360def01/FLAGdda047023 [2021-06-11 06:58:28,918 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:58:28,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-06-11 06:58:28,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3941909/b5ee0ea071ee40e1861bbc3e360def01/FLAGdda047023 [2021-06-11 06:58:29,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3941909/b5ee0ea071ee40e1861bbc3e360def01 [2021-06-11 06:58:29,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:58:29,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:58:29,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:58:29,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:58:29,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:58:29,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de9bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29, skipping insertion in model container [2021-06-11 06:58:29,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:58:29,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:58:29,440 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/safe029_pso.opt.i[949,962] [2021-06-11 06:58:29,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:58:29,674 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:58:29,683 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/safe029_pso.opt.i[949,962] [2021-06-11 06:58:29,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:58:29,780 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:58:29,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29 WrapperNode [2021-06-11 06:58:29,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:58:29,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:58:29,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:58:29,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:58:29,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:58:29,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:58:29,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:58:29,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:58:29,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... [2021-06-11 06:58:29,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:58:29,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:58:29,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:58:29,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:58:29,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:58:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:58:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:58:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:58:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:58:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:58:29,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:58:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:58:29,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:58:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:58:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:58:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:58:29,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:58:29,935 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:58:31,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:58:31,415 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:58:31,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:58:31 BoogieIcfgContainer [2021-06-11 06:58:31,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:58:31,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:58:31,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:58:31,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:58:31,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:58:29" (1/3) ... [2021-06-11 06:58:31,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7f2951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:58:31, skipping insertion in model container [2021-06-11 06:58:31,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:29" (2/3) ... [2021-06-11 06:58:31,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7f2951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:58:31, skipping insertion in model container [2021-06-11 06:58:31,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:58:31" (3/3) ... [2021-06-11 06:58:31,424 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2021-06-11 06:58:31,430 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:58:31,434 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:58:31,435 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:58:31,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,467 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,473 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,473 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,473 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:31,485 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:58:31,501 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 06:58:31,531 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:58:31,532 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:58:31,532 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:58:31,532 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:58:31,532 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:58:31,532 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:58:31,532 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:58:31,532 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:58:31,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 06:58:31,578 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 06:58:31,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:31,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 06:58:31,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 06:58:31,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:31,598 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:31,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:31,617 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:31,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:31,644 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 06:58:31,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:31,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 06:58:31,649 INFO L151 LiptonReduction]: Number of co-enabled transitions 918 [2021-06-11 06:58:31,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:31,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:31,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:32,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:32,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:32,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:32,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:32,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:33,000 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-06-11 06:58:33,316 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 06:58:34,542 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-06-11 06:58:35,074 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:35,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:35,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:35,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:35,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,339 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:58:35,340 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:35,369 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:35,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:35,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:35,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,791 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:58:35,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:35,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:35,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:36,401 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:58:36,755 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 06:58:36,875 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 06:58:36,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:36,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:58:36,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:36,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,903 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:58:36,904 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:36,906 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,909 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 06:58:36,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:36,922 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 06:58:36,923 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 06:58:36,923 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:36,925 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,930 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 06:58:36,931 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 06:58:36,931 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:36,934 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,937 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 06:58:36,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:36,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:37,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:37,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:37,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:58:37,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 06:58:37,682 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-06-11 06:58:37,981 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 06:58:39,084 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2021-06-11 06:58:39,614 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 06:58:40,156 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 181 [2021-06-11 06:58:40,491 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-06-11 06:58:41,027 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:41,553 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:41,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:41,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:41,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:41,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:41,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:41,773 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:58:41,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:41,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:41,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:41,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:42,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:42,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:42,482 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-11 06:58:42,746 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-11 06:58:43,921 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-06-11 06:58:44,448 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 06:58:44,776 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:58:45,080 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:58:45,759 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 06:58:46,371 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 06:58:46,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:46,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:46,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:46,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:46,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:46,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:46,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:46,890 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-11 06:58:47,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:47,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:47,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:47,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:47,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:47,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:47,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:47,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:47,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:47,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:47,678 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 06:58:47,796 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 06:58:48,034 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 06:58:48,158 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 06:58:48,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:48,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:48,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:48,176 INFO L163 LiptonReduction]: Checked pairs total: 2561 [2021-06-11 06:58:48,177 INFO L165 LiptonReduction]: Total number of compositions: 74 [2021-06-11 06:58:48,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16582 [2021-06-11 06:58:48,186 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-11 06:58:48,186 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:48,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:48,187 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 06:58:48,187 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 879487338, now seen corresponding path program 1 times [2021-06-11 06:58:48,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:48,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411979577] [2021-06-11 06:58:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:48,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:48,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411979577] [2021-06-11 06:58:48,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:48,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:58:48,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604154976] [2021-06-11 06:58:48,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:48,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:48,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:48,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 153 [2021-06-11 06:58:48,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:48,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 153 [2021-06-11 06:58:48,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:48,410 INFO L129 PetriNetUnfolder]: 23/60 cut-off events. [2021-06-11 06:58:48,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:48,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 60 events. 23/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 204 event pairs, 9 based on Foata normal form. 6/59 useless extension candidates. Maximal degree in co-relation 106. Up to 37 conditions per place. [2021-06-11 06:58:48,412 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 7 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2021-06-11 06:58:48,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 70 flow [2021-06-11 06:58:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-06-11 06:58:48,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2021-06-11 06:58:48,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2021-06-11 06:58:48,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2021-06-11 06:58:48,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:48,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2021-06-11 06:58:48,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,441 INFO L185 Difference]: Start difference. First operand has 26 places, 21 transitions, 48 flow. Second operand 3 states and 372 transitions. [2021-06-11 06:58:48,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 70 flow [2021-06-11 06:58:48,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:48,445 INFO L241 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2021-06-11 06:58:48,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2021-06-11 06:58:48,447 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2021-06-11 06:58:48,447 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:48,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 40 flow [2021-06-11 06:58:48,448 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 40 flow [2021-06-11 06:58:48,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2021-06-11 06:58:48,451 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 06:58:48,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:48,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:58:48,452 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 06:58:48,518 INFO L163 LiptonReduction]: Checked pairs total: 124 [2021-06-11 06:58:48,519 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:48,519 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-06-11 06:58:48,520 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-06-11 06:58:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:48,520 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:48,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:58:48,521 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash -921173612, now seen corresponding path program 1 times [2021-06-11 06:58:48,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:48,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725688919] [2021-06-11 06:58:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:48,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:48,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725688919] [2021-06-11 06:58:48,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:48,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:58:48,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429156728] [2021-06-11 06:58:48,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:48,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:48,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 153 [2021-06-11 06:58:48,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:48,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 153 [2021-06-11 06:58:48,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:48,635 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-06-11 06:58:48,636 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:48,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2021-06-11 06:58:48,636 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 3 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-06-11 06:58:48,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2021-06-11 06:58:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2021-06-11 06:58:48,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8126361655773421 [2021-06-11 06:58:48,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2021-06-11 06:58:48,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2021-06-11 06:58:48,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:48,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2021-06-11 06:58:48,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,643 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 373 transitions. [2021-06-11 06:58:48,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2021-06-11 06:58:48,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:48,644 INFO L241 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:48,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2021-06-11 06:58:48,644 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2021-06-11 06:58:48,645 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:48,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:48,645 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:48,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:48,650 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-06-11 06:58:48,650 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:48,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2021-06-11 06:58:48,651 INFO L151 LiptonReduction]: Number of co-enabled transitions 118 [2021-06-11 06:58:48,652 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 06:58:48,652 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:48,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 06:58:48,653 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:48,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:48,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:48,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:58:48,653 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1508388437, now seen corresponding path program 1 times [2021-06-11 06:58:48,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:48,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103378258] [2021-06-11 06:58:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:48,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:48,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:48,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103378258] [2021-06-11 06:58:48,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:48,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:58:48,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519849447] [2021-06-11 06:58:48,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:58:48,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:58:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:58:48,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153 [2021-06-11 06:58:48,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:48,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153 [2021-06-11 06:58:48,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:48,822 INFO L129 PetriNetUnfolder]: 35/89 cut-off events. [2021-06-11 06:58:48,822 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 06:58:48,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 89 events. 35/89 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 317 event pairs, 24 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 176. Up to 61 conditions per place. [2021-06-11 06:58:48,823 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 7 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-06-11 06:58:48,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 81 flow [2021-06-11 06:58:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2021-06-11 06:58:48,826 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7429193899782135 [2021-06-11 06:58:48,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2021-06-11 06:58:48,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2021-06-11 06:58:48,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:48,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2021-06-11 06:58:48,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,829 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 341 transitions. [2021-06-11 06:58:48,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 81 flow [2021-06-11 06:58:48,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:48,830 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 71 flow [2021-06-11 06:58:48,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-06-11 06:58:48,831 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2021-06-11 06:58:48,831 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:48,831 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 71 flow [2021-06-11 06:58:48,831 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 71 flow [2021-06-11 06:58:48,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 71 flow [2021-06-11 06:58:48,838 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-06-11 06:58:48,838 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-06-11 06:58:48,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 39 events. 7/39 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 3 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 67. Up to 15 conditions per place. [2021-06-11 06:58:48,839 INFO L151 LiptonReduction]: Number of co-enabled transitions 124 [2021-06-11 06:58:48,844 INFO L163 LiptonReduction]: Checked pairs total: 72 [2021-06-11 06:58:48,844 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:48,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 06:58:48,845 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 71 flow [2021-06-11 06:58:48,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:48,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:48,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:58:48,846 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 718684597, now seen corresponding path program 1 times [2021-06-11 06:58:48,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:48,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080393097] [2021-06-11 06:58:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:48,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:48,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:48,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:48,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:48,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080393097] [2021-06-11 06:58:48,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:48,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:48,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245687261] [2021-06-11 06:58:48,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:48,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:48,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2021-06-11 06:58:48,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:48,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:48,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2021-06-11 06:58:48,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:49,033 INFO L129 PetriNetUnfolder]: 35/92 cut-off events. [2021-06-11 06:58:49,034 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-11 06:58:49,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 92 events. 35/92 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 332 event pairs, 13 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 209. Up to 52 conditions per place. [2021-06-11 06:58:49,035 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 8 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2021-06-11 06:58:49,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 115 flow [2021-06-11 06:58:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:58:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:58:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2021-06-11 06:58:49,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2021-06-11 06:58:49,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2021-06-11 06:58:49,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2021-06-11 06:58:49,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:49,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2021-06-11 06:58:49,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,041 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 71 flow. Second operand 4 states and 446 transitions. [2021-06-11 06:58:49,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 115 flow [2021-06-11 06:58:49,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:49,043 INFO L241 Difference]: Finished difference. Result has 29 places, 22 transitions, 93 flow [2021-06-11 06:58:49,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2021-06-11 06:58:49,043 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2021-06-11 06:58:49,043 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:49,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 93 flow [2021-06-11 06:58:49,043 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 93 flow [2021-06-11 06:58:49,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 93 flow [2021-06-11 06:58:49,050 INFO L129 PetriNetUnfolder]: 10/42 cut-off events. [2021-06-11 06:58:49,050 INFO L130 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2021-06-11 06:58:49,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 42 events. 10/42 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 5 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 93. Up to 18 conditions per place. [2021-06-11 06:58:49,051 INFO L151 LiptonReduction]: Number of co-enabled transitions 132 [2021-06-11 06:58:49,072 INFO L163 LiptonReduction]: Checked pairs total: 58 [2021-06-11 06:58:49,073 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:49,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 06:58:49,074 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 93 flow [2021-06-11 06:58:49,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:49,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:49,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:58:49,074 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:49,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash -484589762, now seen corresponding path program 1 times [2021-06-11 06:58:49,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:49,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546077232] [2021-06-11 06:58:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:49,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:58:49,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:49,159 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-11 06:58:49,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 06:58:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:49,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546077232] [2021-06-11 06:58:49,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:49,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:49,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335868931] [2021-06-11 06:58:49,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:49,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:49,204 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2021-06-11 06:58:49,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:49,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2021-06-11 06:58:49,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:49,277 INFO L129 PetriNetUnfolder]: 28/77 cut-off events. [2021-06-11 06:58:49,278 INFO L130 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2021-06-11 06:58:49,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 77 events. 28/77 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 253 event pairs, 10 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 203. Up to 49 conditions per place. [2021-06-11 06:58:49,279 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 10 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-06-11 06:58:49,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 133 flow [2021-06-11 06:58:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:58:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:58:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2021-06-11 06:58:49,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6830065359477124 [2021-06-11 06:58:49,282 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2021-06-11 06:58:49,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2021-06-11 06:58:49,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:49,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2021-06-11 06:58:49,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,285 INFO L185 Difference]: Start difference. First operand has 29 places, 22 transitions, 93 flow. Second operand 4 states and 418 transitions. [2021-06-11 06:58:49,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 133 flow [2021-06-11 06:58:49,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:49,287 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 112 flow [2021-06-11 06:58:49,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-06-11 06:58:49,287 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2021-06-11 06:58:49,287 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:49,287 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 112 flow [2021-06-11 06:58:49,288 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 112 flow [2021-06-11 06:58:49,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 112 flow [2021-06-11 06:58:49,295 INFO L129 PetriNetUnfolder]: 11/47 cut-off events. [2021-06-11 06:58:49,295 INFO L130 PetriNetUnfolder]: For 64/68 co-relation queries the response was YES. [2021-06-11 06:58:49,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 47 events. 11/47 cut-off events. For 64/68 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 169 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 117. Up to 18 conditions per place. [2021-06-11 06:58:49,295 INFO L151 LiptonReduction]: Number of co-enabled transitions 140 [2021-06-11 06:58:49,297 INFO L163 LiptonReduction]: Checked pairs total: 48 [2021-06-11 06:58:49,297 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:49,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 06:58:49,298 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 112 flow [2021-06-11 06:58:49,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:49,298 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:49,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:58:49,299 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash 804384372, now seen corresponding path program 1 times [2021-06-11 06:58:49,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:49,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726189833] [2021-06-11 06:58:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:49,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:49,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:58:49,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:49,382 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-06-11 06:58:49,383 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-06-11 06:58:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:49,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726189833] [2021-06-11 06:58:49,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:49,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:49,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926626650] [2021-06-11 06:58:49,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:58:49,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:58:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:58:49,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2021-06-11 06:58:49,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:49,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2021-06-11 06:58:49,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:49,461 INFO L129 PetriNetUnfolder]: 26/72 cut-off events. [2021-06-11 06:58:49,461 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2021-06-11 06:58:49,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 72 events. 26/72 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 251 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 211. Up to 43 conditions per place. [2021-06-11 06:58:49,462 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 10 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-06-11 06:58:49,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 146 flow [2021-06-11 06:58:49,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:58:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:58:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2021-06-11 06:58:49,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2021-06-11 06:58:49,466 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2021-06-11 06:58:49,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2021-06-11 06:58:49,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:49,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2021-06-11 06:58:49,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,469 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 112 flow. Second operand 4 states and 425 transitions. [2021-06-11 06:58:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 146 flow [2021-06-11 06:58:49,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 137 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:49,470 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2021-06-11 06:58:49,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-06-11 06:58:49,471 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2021-06-11 06:58:49,471 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:49,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 118 flow [2021-06-11 06:58:49,471 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 118 flow [2021-06-11 06:58:49,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 118 flow [2021-06-11 06:58:49,478 INFO L129 PetriNetUnfolder]: 13/47 cut-off events. [2021-06-11 06:58:49,478 INFO L130 PetriNetUnfolder]: For 102/106 co-relation queries the response was YES. [2021-06-11 06:58:49,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 47 events. 13/47 cut-off events. For 102/106 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 4 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 124. Up to 18 conditions per place. [2021-06-11 06:58:49,479 INFO L151 LiptonReduction]: Number of co-enabled transitions 140 [2021-06-11 06:58:49,480 INFO L163 LiptonReduction]: Checked pairs total: 48 [2021-06-11 06:58:49,480 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:49,480 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:58:49,481 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2021-06-11 06:58:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,481 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:49,481 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:49,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:58:49,481 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1123276076, now seen corresponding path program 1 times [2021-06-11 06:58:49,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:49,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112531143] [2021-06-11 06:58:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:49,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:49,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:49,547 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-06-11 06:58:49,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 06:58:49,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:58:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:49,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112531143] [2021-06-11 06:58:49,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:49,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:49,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670486322] [2021-06-11 06:58:49,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:49,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:49,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2021-06-11 06:58:49,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:49,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2021-06-11 06:58:49,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:49,644 INFO L129 PetriNetUnfolder]: 32/89 cut-off events. [2021-06-11 06:58:49,644 INFO L130 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2021-06-11 06:58:49,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 89 events. 32/89 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 336 event pairs, 4 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 261. Up to 47 conditions per place. [2021-06-11 06:58:49,645 INFO L132 encePairwiseOnDemand]: 146/153 looper letters, 10 selfloop transitions, 10 changer transitions 0/31 dead transitions. [2021-06-11 06:58:49,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 184 flow [2021-06-11 06:58:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2021-06-11 06:58:49,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2021-06-11 06:58:49,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2021-06-11 06:58:49,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2021-06-11 06:58:49,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:49,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2021-06-11 06:58:49,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,651 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 5 states and 527 transitions. [2021-06-11 06:58:49,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 184 flow [2021-06-11 06:58:49,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 174 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:49,653 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 167 flow [2021-06-11 06:58:49,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-06-11 06:58:49,653 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2021-06-11 06:58:49,653 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:49,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 167 flow [2021-06-11 06:58:49,654 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 167 flow [2021-06-11 06:58:49,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 167 flow [2021-06-11 06:58:49,663 INFO L129 PetriNetUnfolder]: 24/73 cut-off events. [2021-06-11 06:58:49,664 INFO L130 PetriNetUnfolder]: For 193/194 co-relation queries the response was YES. [2021-06-11 06:58:49,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 73 events. 24/73 cut-off events. For 193/194 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 253 event pairs, 6 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 232. Up to 28 conditions per place. [2021-06-11 06:58:49,665 INFO L151 LiptonReduction]: Number of co-enabled transitions 146 [2021-06-11 06:58:49,667 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 06:58:49,667 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:49,667 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 06:58:49,668 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 167 flow [2021-06-11 06:58:49,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:49,668 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:49,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:58:49,668 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1239945356, now seen corresponding path program 2 times [2021-06-11 06:58:49,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:49,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087294543] [2021-06-11 06:58:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:49,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:58:49,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 06:58:49,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 06:58:49,738 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-06-11 06:58:49,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 06:58:49,754 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-06-11 06:58:49,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 06:58:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:49,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087294543] [2021-06-11 06:58:49,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:49,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:58:49,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505361222] [2021-06-11 06:58:49,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:58:49,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:58:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:58:49,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2021-06-11 06:58:49,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 167 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:49,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2021-06-11 06:58:49,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:49,924 INFO L129 PetriNetUnfolder]: 127/247 cut-off events. [2021-06-11 06:58:49,924 INFO L130 PetriNetUnfolder]: For 597/597 co-relation queries the response was YES. [2021-06-11 06:58:49,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 247 events. 127/247 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1027 event pairs, 11 based on Foata normal form. 5/229 useless extension candidates. Maximal degree in co-relation 806. Up to 153 conditions per place. [2021-06-11 06:58:49,926 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 20 selfloop transitions, 15 changer transitions 3/45 dead transitions. [2021-06-11 06:58:49,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 294 flow [2021-06-11 06:58:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:58:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:58:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2021-06-11 06:58:49,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.644880174291939 [2021-06-11 06:58:49,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2021-06-11 06:58:49,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2021-06-11 06:58:49,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:49,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2021-06-11 06:58:49,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,933 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,933 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 167 flow. Second operand 6 states and 592 transitions. [2021-06-11 06:58:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 294 flow [2021-06-11 06:58:49,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 283 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:49,936 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 233 flow [2021-06-11 06:58:49,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-06-11 06:58:49,936 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2021-06-11 06:58:49,936 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:49,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 233 flow [2021-06-11 06:58:49,937 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 233 flow [2021-06-11 06:58:49,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 233 flow [2021-06-11 06:58:49,947 INFO L129 PetriNetUnfolder]: 24/78 cut-off events. [2021-06-11 06:58:49,947 INFO L130 PetriNetUnfolder]: For 278/285 co-relation queries the response was YES. [2021-06-11 06:58:49,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 78 events. 24/78 cut-off events. For 278/285 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 5 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 296. Up to 29 conditions per place. [2021-06-11 06:58:49,948 INFO L151 LiptonReduction]: Number of co-enabled transitions 170 [2021-06-11 06:58:49,951 INFO L163 LiptonReduction]: Checked pairs total: 44 [2021-06-11 06:58:49,951 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:49,951 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 06:58:49,951 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 233 flow [2021-06-11 06:58:49,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:49,952 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:49,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:58:49,952 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2137406166, now seen corresponding path program 1 times [2021-06-11 06:58:49,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:49,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737401525] [2021-06-11 06:58:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:49,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:49,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:49,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:49,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737401525] [2021-06-11 06:58:49,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:49,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:58:49,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077791991] [2021-06-11 06:58:49,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:49,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:49,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 153 [2021-06-11 06:58:49,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:49,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:49,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 153 [2021-06-11 06:58:49,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:50,012 INFO L129 PetriNetUnfolder]: 19/89 cut-off events. [2021-06-11 06:58:50,013 INFO L130 PetriNetUnfolder]: For 374/384 co-relation queries the response was YES. [2021-06-11 06:58:50,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 89 events. 19/89 cut-off events. For 374/384 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 405 event pairs, 3 based on Foata normal form. 8/96 useless extension candidates. Maximal degree in co-relation 314. Up to 31 conditions per place. [2021-06-11 06:58:50,013 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 3 selfloop transitions, 3 changer transitions 5/33 dead transitions. [2021-06-11 06:58:50,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 245 flow [2021-06-11 06:58:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-06-11 06:58:50,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2021-06-11 06:58:50,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2021-06-11 06:58:50,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2021-06-11 06:58:50,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:50,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2021-06-11 06:58:50,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,018 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 233 flow. Second operand 3 states and 372 transitions. [2021-06-11 06:58:50,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 245 flow [2021-06-11 06:58:50,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 219 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-06-11 06:58:50,020 INFO L241 Difference]: Finished difference. Result has 44 places, 28 transitions, 180 flow [2021-06-11 06:58:50,021 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2021-06-11 06:58:50,021 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2021-06-11 06:58:50,021 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:50,021 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 180 flow [2021-06-11 06:58:50,021 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 180 flow [2021-06-11 06:58:50,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 180 flow [2021-06-11 06:58:50,030 INFO L129 PetriNetUnfolder]: 13/65 cut-off events. [2021-06-11 06:58:50,030 INFO L130 PetriNetUnfolder]: For 188/190 co-relation queries the response was YES. [2021-06-11 06:58:50,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 65 events. 13/65 cut-off events. For 188/190 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 248 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 208. Up to 27 conditions per place. [2021-06-11 06:58:50,031 INFO L151 LiptonReduction]: Number of co-enabled transitions 138 [2021-06-11 06:58:50,033 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 06:58:50,033 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:50,033 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-06-11 06:58:50,033 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 180 flow [2021-06-11 06:58:50,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:50,034 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:50,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:58:50,034 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1844524225, now seen corresponding path program 1 times [2021-06-11 06:58:50,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:50,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721656083] [2021-06-11 06:58:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:50,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:50,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:50,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:50,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:58:50,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:50,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721656083] [2021-06-11 06:58:50,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:50,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:50,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946812912] [2021-06-11 06:58:50,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:58:50,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:58:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:58:50,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2021-06-11 06:58:50,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:50,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2021-06-11 06:58:50,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:50,209 INFO L129 PetriNetUnfolder]: 30/103 cut-off events. [2021-06-11 06:58:50,209 INFO L130 PetriNetUnfolder]: For 301/310 co-relation queries the response was YES. [2021-06-11 06:58:50,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 103 events. 30/103 cut-off events. For 301/310 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 447 event pairs, 1 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 363. Up to 47 conditions per place. [2021-06-11 06:58:50,210 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 8 selfloop transitions, 5 changer transitions 10/34 dead transitions. [2021-06-11 06:58:50,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 258 flow [2021-06-11 06:58:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:58:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:58:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2021-06-11 06:58:50,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7004357298474946 [2021-06-11 06:58:50,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2021-06-11 06:58:50,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2021-06-11 06:58:50,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:50,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2021-06-11 06:58:50,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,217 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,217 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 180 flow. Second operand 6 states and 643 transitions. [2021-06-11 06:58:50,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 258 flow [2021-06-11 06:58:50,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 235 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-06-11 06:58:50,219 INFO L241 Difference]: Finished difference. Result has 44 places, 22 transitions, 132 flow [2021-06-11 06:58:50,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=22} [2021-06-11 06:58:50,219 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2021-06-11 06:58:50,219 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:50,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 22 transitions, 132 flow [2021-06-11 06:58:50,220 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 22 transitions, 132 flow [2021-06-11 06:58:50,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 132 flow [2021-06-11 06:58:50,226 INFO L129 PetriNetUnfolder]: 7/44 cut-off events. [2021-06-11 06:58:50,227 INFO L130 PetriNetUnfolder]: For 133/135 co-relation queries the response was YES. [2021-06-11 06:58:50,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 44 events. 7/44 cut-off events. For 133/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 137 event pairs, 2 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 144. Up to 19 conditions per place. [2021-06-11 06:58:50,227 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 06:58:50,228 INFO L163 LiptonReduction]: Checked pairs total: 28 [2021-06-11 06:58:50,229 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:50,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 06:58:50,229 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 132 flow [2021-06-11 06:58:50,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:50,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:50,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:58:50,230 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:50,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1834347235, now seen corresponding path program 2 times [2021-06-11 06:58:50,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:50,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099105808] [2021-06-11 06:58:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:50,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:50,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:50,277 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-11 06:58:50,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 06:58:50,296 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 06:58:50,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:58:50,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:58:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:50,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099105808] [2021-06-11 06:58:50,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:50,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:50,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277916651] [2021-06-11 06:58:50,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:58:50,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:58:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:58:50,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2021-06-11 06:58:50,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:50,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2021-06-11 06:58:50,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:50,409 INFO L129 PetriNetUnfolder]: 20/90 cut-off events. [2021-06-11 06:58:50,410 INFO L130 PetriNetUnfolder]: For 232/233 co-relation queries the response was YES. [2021-06-11 06:58:50,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 90 events. 20/90 cut-off events. For 232/233 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 404 event pairs, 0 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 300. Up to 30 conditions per place. [2021-06-11 06:58:50,410 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 8 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2021-06-11 06:58:50,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 25 transitions, 174 flow [2021-06-11 06:58:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2021-06-11 06:58:50,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6692810457516339 [2021-06-11 06:58:50,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2021-06-11 06:58:50,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2021-06-11 06:58:50,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:50,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2021-06-11 06:58:50,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,416 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 132 flow. Second operand 5 states and 512 transitions. [2021-06-11 06:58:50,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 25 transitions, 174 flow [2021-06-11 06:58:50,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 136 flow, removed 10 selfloop flow, removed 9 redundant places. [2021-06-11 06:58:50,418 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 118 flow [2021-06-11 06:58:50,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-06-11 06:58:50,418 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2021-06-11 06:58:50,418 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:50,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 118 flow [2021-06-11 06:58:50,419 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 118 flow [2021-06-11 06:58:50,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 118 flow [2021-06-11 06:58:50,425 INFO L129 PetriNetUnfolder]: 3/45 cut-off events. [2021-06-11 06:58:50,425 INFO L130 PetriNetUnfolder]: For 61/62 co-relation queries the response was YES. [2021-06-11 06:58:50,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 45 events. 3/45 cut-off events. For 61/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 150 event pairs, 0 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 114. Up to 18 conditions per place. [2021-06-11 06:58:50,425 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 06:58:50,484 INFO L163 LiptonReduction]: Checked pairs total: 42 [2021-06-11 06:58:50,485 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:50,485 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-06-11 06:58:50,485 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 118 flow [2021-06-11 06:58:50,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:50,486 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:50,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 06:58:50,486 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1835082369, now seen corresponding path program 1 times [2021-06-11 06:58:50,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:50,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677455624] [2021-06-11 06:58:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:50,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:50,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:50,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:50,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677455624] [2021-06-11 06:58:50,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:50,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:50,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74829460] [2021-06-11 06:58:50,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:58:50,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:58:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:58:50,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 153 [2021-06-11 06:58:50,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:50,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 153 [2021-06-11 06:58:50,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:50,568 INFO L129 PetriNetUnfolder]: 45/147 cut-off events. [2021-06-11 06:58:50,568 INFO L130 PetriNetUnfolder]: For 137/149 co-relation queries the response was YES. [2021-06-11 06:58:50,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 147 events. 45/147 cut-off events. For 137/149 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 783 event pairs, 8 based on Foata normal form. 16/134 useless extension candidates. Maximal degree in co-relation 337. Up to 64 conditions per place. [2021-06-11 06:58:50,569 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 4 selfloop transitions, 7 changer transitions 5/30 dead transitions. [2021-06-11 06:58:50,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 162 flow [2021-06-11 06:58:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2021-06-11 06:58:50,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7790849673202614 [2021-06-11 06:58:50,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2021-06-11 06:58:50,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2021-06-11 06:58:50,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:50,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2021-06-11 06:58:50,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,575 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 118 flow. Second operand 5 states and 596 transitions. [2021-06-11 06:58:50,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 162 flow [2021-06-11 06:58:50,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 155 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:50,578 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 147 flow [2021-06-11 06:58:50,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2021-06-11 06:58:50,578 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2021-06-11 06:58:50,578 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:50,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 25 transitions, 147 flow [2021-06-11 06:58:50,579 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 25 transitions, 147 flow [2021-06-11 06:58:50,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 147 flow [2021-06-11 06:58:50,587 INFO L129 PetriNetUnfolder]: 11/67 cut-off events. [2021-06-11 06:58:50,587 INFO L130 PetriNetUnfolder]: For 129/147 co-relation queries the response was YES. [2021-06-11 06:58:50,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 67 events. 11/67 cut-off events. For 129/147 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 265 event pairs, 6 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 199. Up to 27 conditions per place. [2021-06-11 06:58:50,588 INFO L151 LiptonReduction]: Number of co-enabled transitions 90 [2021-06-11 06:58:50,591 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:58:50,591 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:50,591 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 06:58:50,592 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 147 flow [2021-06-11 06:58:50,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:50,593 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:50,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 06:58:50,593 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash -150085858, now seen corresponding path program 1 times [2021-06-11 06:58:50,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:50,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841208122] [2021-06-11 06:58:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:50,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:50,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:50,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:50,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:50,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841208122] [2021-06-11 06:58:50,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:50,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:50,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109322763] [2021-06-11 06:58:50,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:50,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:50,715 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 153 [2021-06-11 06:58:50,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:50,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 153 [2021-06-11 06:58:50,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:50,767 INFO L129 PetriNetUnfolder]: 9/55 cut-off events. [2021-06-11 06:58:50,767 INFO L130 PetriNetUnfolder]: For 94/160 co-relation queries the response was YES. [2021-06-11 06:58:50,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 55 events. 9/55 cut-off events. For 94/160 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 182 event pairs, 0 based on Foata normal form. 23/73 useless extension candidates. Maximal degree in co-relation 183. Up to 23 conditions per place. [2021-06-11 06:58:50,768 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 2 selfloop transitions, 9 changer transitions 6/29 dead transitions. [2021-06-11 06:58:50,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 29 transitions, 196 flow [2021-06-11 06:58:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:58:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:58:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2021-06-11 06:58:50,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7740429505135388 [2021-06-11 06:58:50,771 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2021-06-11 06:58:50,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2021-06-11 06:58:50,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:50,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2021-06-11 06:58:50,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 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-06-11 06:58:50,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 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-06-11 06:58:50,775 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 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-06-11 06:58:50,775 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 147 flow. Second operand 7 states and 829 transitions. [2021-06-11 06:58:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 29 transitions, 196 flow [2021-06-11 06:58:50,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 169 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-06-11 06:58:50,776 INFO L241 Difference]: Finished difference. Result has 43 places, 23 transitions, 138 flow [2021-06-11 06:58:50,776 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2021-06-11 06:58:50,776 INFO L343 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2021-06-11 06:58:50,776 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:50,776 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 23 transitions, 138 flow [2021-06-11 06:58:50,777 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 23 transitions, 138 flow [2021-06-11 06:58:50,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 23 transitions, 138 flow [2021-06-11 06:58:50,780 INFO L129 PetriNetUnfolder]: 2/28 cut-off events. [2021-06-11 06:58:50,780 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-11 06:58:50,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 28 events. 2/28 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 42 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 86. Up to 11 conditions per place. [2021-06-11 06:58:50,781 INFO L151 LiptonReduction]: Number of co-enabled transitions 44 [2021-06-11 06:58:50,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:50,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:50,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:50,922 INFO L163 LiptonReduction]: Checked pairs total: 4 [2021-06-11 06:58:50,922 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:58:50,922 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 146 [2021-06-11 06:58:50,922 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 134 flow [2021-06-11 06:58:50,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:50,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:50,923 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:50,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 06:58:50,923 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1224937725, now seen corresponding path program 1 times [2021-06-11 06:58:50,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:50,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727889220] [2021-06-11 06:58:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:58:50,953 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:58:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:58:50,982 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:58:51,005 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:58:51,005 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:58:51,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 06:58:51,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:58:51 BasicIcfg [2021-06-11 06:58:51,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:58:51,062 INFO L168 Benchmark]: Toolchain (without parser) took 21793.58 ms. Allocated memory was 346.0 MB in the beginning and 654.3 MB in the end (delta: 308.3 MB). Free memory was 308.4 MB in the beginning and 547.0 MB in the end (delta: -238.6 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,062 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 346.0 MB. Free memory was 326.7 MB in the beginning and 326.6 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:58:51,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.86 ms. Allocated memory is still 346.0 MB. Free memory was 308.2 MB in the beginning and 305.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.94 ms. Allocated memory is still 346.0 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,063 INFO L168 Benchmark]: Boogie Preprocessor took 29.26 ms. Allocated memory is still 346.0 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,063 INFO L168 Benchmark]: RCFGBuilder took 1556.86 ms. Allocated memory is still 346.0 MB. Free memory was 301.3 MB in the beginning and 273.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,063 INFO L168 Benchmark]: TraceAbstraction took 19643.28 ms. Allocated memory was 346.0 MB in the beginning and 654.3 MB in the end (delta: 308.3 MB). Free memory was 273.1 MB in the beginning and 547.0 MB in the end (delta: -273.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:51,064 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.16 ms. Allocated memory is still 346.0 MB. Free memory was 326.7 MB in the beginning and 326.6 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 508.86 ms. Allocated memory is still 346.0 MB. Free memory was 308.2 MB in the beginning and 305.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.94 ms. Allocated memory is still 346.0 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.26 ms. Allocated memory is still 346.0 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1556.86 ms. Allocated memory is still 346.0 MB. Free memory was 301.3 MB in the beginning and 273.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19643.28 ms. Allocated memory was 346.0 MB in the beginning and 654.3 MB in the end (delta: 308.3 MB). Free memory was 273.1 MB in the beginning and 547.0 MB in the end (delta: -273.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16560.0ms, 82 PlacesBefore, 26 PlacesAfterwards, 77 TransitionsBefore, 21 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 2561 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1207, positive: 1094, positive conditional: 0, positive unconditional: 1094, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 725, positive: 670, positive conditional: 0, positive unconditional: 670, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 725, positive: 670, positive conditional: 0, positive unconditional: 670, 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: 725, positive: 655, positive conditional: 0, positive unconditional: 655, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1242, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 1153, negative conditional: 0, negative unconditional: 1153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1207, positive: 424, positive conditional: 0, positive unconditional: 424, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 725, unknown conditional: 0, unknown unconditional: 725] , Statistics on independence cache: Total cache size (in pairs): 1318, Positive cache size: 1263, Positive conditional cache size: 0, Positive unconditional cache size: 1263, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.1ms, 24 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1271, Positive conditional cache size: 0, Positive unconditional cache size: 1271, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9ms, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1271, Positive conditional cache size: 0, Positive unconditional cache size: 1271, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.3ms, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1271, Positive conditional cache size: 0, Positive unconditional cache size: 1271, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.3ms, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 58 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1333, Positive cache size: 1272, Positive conditional cache size: 0, Positive unconditional cache size: 1272, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4ms, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1273, Positive conditional cache size: 0, Positive unconditional cache size: 1273, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1273, Positive conditional cache size: 0, Positive unconditional cache size: 1273, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1273, Positive conditional cache size: 0, Positive unconditional cache size: 1273, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1274, Positive conditional cache size: 0, Positive unconditional cache size: 1274, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6ms, 44 PlacesBefore, 43 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1274, Positive conditional cache size: 0, Positive unconditional cache size: 1274, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8ms, 44 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 28 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1274, Positive conditional cache size: 0, Positive unconditional cache size: 1274, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.0ms, 35 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1337, Positive cache size: 1274, Positive conditional cache size: 0, Positive unconditional cache size: 1274, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.2ms, 40 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1337, Positive cache size: 1274, Positive conditional cache size: 0, Positive unconditional cache size: 1274, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 145.3ms, 43 PlacesBefore, 40 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1436, Positive cache size: 1373, Positive conditional cache size: 0, Positive unconditional cache size: 1373, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2479; [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2480; [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19477.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 977.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16651.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 27 SDslu, 20 SDs, 0 SdLazy, 294 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 353.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 439.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 58, 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: 32.0ms SsaConstructionTime, 295.0ms SatisfiabilityAnalysisTime, 813.7ms InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...