/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:33:01,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:33:01,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:33:01,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:33:01,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:33:01,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:33:01,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:33:01,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:33:01,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:33:01,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:33:01,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:33:01,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:33:01,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:33:01,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:33:01,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:33:01,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:33:01,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:33:01,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:33:01,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:33:01,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:33:01,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:33:01,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:33:01,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:33:01,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:33:01,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:33:01,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:33:01,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:33:01,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:33:01,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:33:01,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:33:01,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:33:01,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:33:01,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:33:01,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:33:01,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:33:01,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:33:01,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:33:01,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:33:01,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:33:01,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:33:01,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:33:01,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:33:01,933 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:33:01,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:33:01,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:33:01,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:33:01,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:33:01,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:33:01,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:33:01,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:33:01,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:33:01,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:33:01,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:33:01,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:33:01,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:33:01,942 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-03-26 00:33:02,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:33:02,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:33:02,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:33:02,243 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:33:02,243 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:33:02,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-26 00:33:02,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9542ccd/2371d8cc80f64443a61b8afa0e5af47f/FLAGa854db142 [2021-03-26 00:33:02,913 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:33:02,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-26 00:33:02,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9542ccd/2371d8cc80f64443a61b8afa0e5af47f/FLAGa854db142 [2021-03-26 00:33:03,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9542ccd/2371d8cc80f64443a61b8afa0e5af47f [2021-03-26 00:33:03,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:33:03,280 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:33:03,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:33:03,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:33:03,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:33:03,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03, skipping insertion in model container [2021-03-26 00:33:03,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:33:03,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:33:03,511 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/safe001_pso.oepc.i[950,963] [2021-03-26 00:33:03,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:33:03,710 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:33:03,723 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/safe001_pso.oepc.i[950,963] [2021-03-26 00:33:03,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:33:03,848 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:33:03,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03 WrapperNode [2021-03-26 00:33:03,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:33:03,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:33:03,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:33:03,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:33:03,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:33:03,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:33:03,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:33:03,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:33:03,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... [2021-03-26 00:33:03,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:33:03,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:33:03,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:33:03,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:33:03,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:33:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:33:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:33:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:33:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:33:04,075 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:33:05,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:33:05,792 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:33:05,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:33:05 BoogieIcfgContainer [2021-03-26 00:33:05,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:33:05,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:33:05,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:33:05,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:33:05,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:33:03" (1/3) ... [2021-03-26 00:33:05,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3d702c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:33:05, skipping insertion in model container [2021-03-26 00:33:05,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:33:03" (2/3) ... [2021-03-26 00:33:05,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3d702c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:33:05, skipping insertion in model container [2021-03-26 00:33:05,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:33:05" (3/3) ... [2021-03-26 00:33:05,801 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-03-26 00:33:05,807 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:33:05,811 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:33:05,812 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:33:05,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,862 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:33:05,871 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:33:05,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:33:05,903 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:33:05,904 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:33:05,904 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:33:05,904 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:33:05,904 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:33:05,904 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:33:05,904 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:33:05,904 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:33:05,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:33:05,944 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:33:05,945 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:05,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:33:05,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:33:05,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:33:05,953 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:05,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:33:05,966 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:33:05,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:33:05,992 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:33:05,993 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:05,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:33:05,997 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-26 00:33:07,848 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:33:08,400 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 00:33:09,836 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:33:10,410 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:33:10,581 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:33:10,982 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:33:11,132 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:33:12,280 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:33:12,577 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:33:13,184 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:33:13,794 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:33:13,943 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-26 00:33:13,944 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:33:13,945 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7993 [2021-03-26 00:33:13,954 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:33:13,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:13,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:13,955 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:13,956 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-26 00:33:13,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:13,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862143653] [2021-03-26 00:33:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:14,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:14,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:14,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:14,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:14,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862143653] [2021-03-26 00:33:14,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:14,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:33:14,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803854169] [2021-03-26 00:33:14,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:33:14,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:33:14,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:33:14,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-26 00:33:14,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:14,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:14,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-26 00:33:14,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:14,331 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-26 00:33:14,331 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:14,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-26 00:33:14,334 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 00:33:14,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 00:33:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:33:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:33:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 00:33:14,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-26 00:33:14,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 00:33:14,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 00:33:14,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:14,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 00:33:14,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:14,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:14,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:14,372 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-26 00:33:14,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 00:33:14,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:33:14,376 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 00:33:14,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 00:33:14,378 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:33:14,378 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:14,379 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:33:14,380 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:33:14,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 00:33:14,384 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 00:33:14,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:14,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:33:14,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:33:14,952 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:33:15,234 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:33:15,858 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:33:16,447 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:33:17,216 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-26 00:33:17,216 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:33:17,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2839 [2021-03-26 00:33:17,218 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:33:17,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:17,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:17,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:17,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:33:17,219 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-26 00:33:17,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:17,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947146583] [2021-03-26 00:33:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:17,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:17,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:17,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:17,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:17,385 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:33:17,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:33:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:17,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947146583] [2021-03-26 00:33:17,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:17,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:17,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207177004] [2021-03-26 00:33:17,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:33:17,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:33:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:33:17,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 169 [2021-03-26 00:33:17,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:17,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:17,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 169 [2021-03-26 00:33:17,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:17,406 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:33:17,406 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:33:17,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:33:17,406 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 00:33:17,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 00:33:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:33:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:33:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2021-03-26 00:33:17,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8777120315581854 [2021-03-26 00:33:17,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2021-03-26 00:33:17,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2021-03-26 00:33:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:17,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2021-03-26 00:33:17,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:17,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:17,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:17,412 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 445 transitions. [2021-03-26 00:33:17,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 00:33:17,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:33:17,413 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 00:33:17,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 00:33:17,413 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:33:17,413 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:17,414 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:33:17,414 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:33:17,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:33:17,417 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:33:17,417 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:33:17,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:33:17,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 00:33:18,107 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:33:18,262 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:33:18,541 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:33:18,669 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:33:18,672 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 00:33:18,673 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:33:18,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1260 [2021-03-26 00:33:18,674 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:33:18,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:18,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:18,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:33:18,675 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1192546168, now seen corresponding path program 1 times [2021-03-26 00:33:18,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:18,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992679866] [2021-03-26 00:33:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:18,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:18,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:18,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:18,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:18,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:18,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:18,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992679866] [2021-03-26 00:33:18,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:18,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:18,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952419743] [2021-03-26 00:33:18,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:33:18,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:33:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:33:18,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 00:33:18,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:18,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 00:33:18,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:18,825 INFO L129 PetriNetUnfolder]: 13/71 cut-off events. [2021-03-26 00:33:18,825 INFO L130 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2021-03-26 00:33:18,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 71 events. 13/71 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 271 event pairs, 3 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 117. Up to 15 conditions per place. [2021-03-26 00:33:18,826 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 5 selfloop transitions, 3 changer transitions 4/27 dead transitions. [2021-03-26 00:33:18,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 95 flow [2021-03-26 00:33:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:33:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:33:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2021-03-26 00:33:18,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391812865497076 [2021-03-26 00:33:18,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2021-03-26 00:33:18,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2021-03-26 00:33:18,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:18,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2021-03-26 00:33:18,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,832 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 574 transitions. [2021-03-26 00:33:18,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 95 flow [2021-03-26 00:33:18,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:33:18,833 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 00:33:18,833 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:33:18,833 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:18,834 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,834 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,838 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 00:33:18,838 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:33:18,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 00:33:18,838 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 00:33:18,877 INFO L154 LiptonReduction]: Checked pairs total: 199 [2021-03-26 00:33:18,877 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:33:18,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 00:33:18,878 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,879 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:18,879 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:18,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:33:18,880 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1360024109, now seen corresponding path program 1 times [2021-03-26 00:33:18,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:18,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688627441] [2021-03-26 00:33:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:18,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:18,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:18,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688627441] [2021-03-26 00:33:18,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:18,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:33:18,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098771189] [2021-03-26 00:33:18,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:33:18,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:33:18,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:33:18,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-26 00:33:18,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:18,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-26 00:33:18,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:18,964 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 00:33:18,964 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 00:33:18,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 1/25 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 1 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2021-03-26 00:33:18,964 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 00:33:18,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 74 flow [2021-03-26 00:33:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:33:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:33:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 00:33:18,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-26 00:33:18,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 00:33:18,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 00:33:18,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:18,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 00:33:18,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:18,970 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 3 states and 460 transitions. [2021-03-26 00:33:18,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 74 flow [2021-03-26 00:33:18,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 66 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 00:33:18,971 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 00:33:18,971 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:33:18,971 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:18,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:18,976 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 00:33:18,976 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 00:33:18,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 00:33:18,976 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-26 00:33:19,015 INFO L154 LiptonReduction]: Checked pairs total: 184 [2021-03-26 00:33:19,016 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:33:19,016 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-26 00:33:19,017 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 00:33:19,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:19,017 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:19,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:33:19,018 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash 788928311, now seen corresponding path program 1 times [2021-03-26 00:33:19,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:19,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989452301] [2021-03-26 00:33:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:19,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:19,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:19,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989452301] [2021-03-26 00:33:19,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:19,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:33:19,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416356865] [2021-03-26 00:33:19,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:33:19,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:33:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:33:19,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 171 [2021-03-26 00:33:19,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:19,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 171 [2021-03-26 00:33:19,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:19,092 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:33:19,092 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:33:19,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 32 events. 3/32 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 64. Up to 7 conditions per place. [2021-03-26 00:33:19,092 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 5 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-26 00:33:19,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 22 transitions, 87 flow [2021-03-26 00:33:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:33:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:33:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2021-03-26 00:33:19,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2021-03-26 00:33:19,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2021-03-26 00:33:19,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2021-03-26 00:33:19,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:19,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2021-03-26 00:33:19,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,098 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 3 states and 440 transitions. [2021-03-26 00:33:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 22 transitions, 87 flow [2021-03-26 00:33:19,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 22 transitions, 79 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:33:19,099 INFO L241 Difference]: Finished difference. Result has 35 places, 21 transitions, 70 flow [2021-03-26 00:33:19,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2021-03-26 00:33:19,099 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-26 00:33:19,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:19,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 70 flow [2021-03-26 00:33:19,100 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 70 flow [2021-03-26 00:33:19,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 70 flow [2021-03-26 00:33:19,103 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:33:19,103 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 00:33:19,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 0/21 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:33:19,103 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-26 00:33:19,409 INFO L154 LiptonReduction]: Checked pairs total: 374 [2021-03-26 00:33:19,409 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:33:19,409 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 310 [2021-03-26 00:33:19,410 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 68 flow [2021-03-26 00:33:19,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,411 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:19,411 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:19,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:33:19,411 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1313154008, now seen corresponding path program 1 times [2021-03-26 00:33:19,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:19,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984430041] [2021-03-26 00:33:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:19,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:33:19,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:33:19,517 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:33:19,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:33:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:19,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984430041] [2021-03-26 00:33:19,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:19,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:19,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044881774] [2021-03-26 00:33:19,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:33:19,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:19,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:33:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:33:19,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 172 [2021-03-26 00:33:19,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:19,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 172 [2021-03-26 00:33:19,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:19,616 INFO L129 PetriNetUnfolder]: 53/130 cut-off events. [2021-03-26 00:33:19,617 INFO L130 PetriNetUnfolder]: For 104/105 co-relation queries the response was YES. [2021-03-26 00:33:19,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 130 events. 53/130 cut-off events. For 104/105 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 523 event pairs, 35 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 288. Up to 90 conditions per place. [2021-03-26 00:33:19,618 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2021-03-26 00:33:19,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 112 flow [2021-03-26 00:33:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:33:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:33:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2021-03-26 00:33:19,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2021-03-26 00:33:19,624 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2021-03-26 00:33:19,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2021-03-26 00:33:19,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:19,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2021-03-26 00:33:19,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,627 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,627 INFO L185 Difference]: Start difference. First operand has 34 places, 20 transitions, 68 flow. Second operand 4 states and 520 transitions. [2021-03-26 00:33:19,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 112 flow [2021-03-26 00:33:19,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 100 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:33:19,629 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 95 flow [2021-03-26 00:33:19,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-26 00:33:19,629 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-26 00:33:19,629 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:19,630 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 95 flow [2021-03-26 00:33:19,630 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 95 flow [2021-03-26 00:33:19,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2021-03-26 00:33:19,636 INFO L129 PetriNetUnfolder]: 9/50 cut-off events. [2021-03-26 00:33:19,637 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 00:33:19,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 50 events. 9/50 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 4 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 99. Up to 21 conditions per place. [2021-03-26 00:33:19,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 00:33:19,784 INFO L154 LiptonReduction]: Checked pairs total: 145 [2021-03-26 00:33:19,784 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:33:19,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-03-26 00:33:19,786 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 95 flow [2021-03-26 00:33:19,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:19,786 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:19,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:33:19,787 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1736084084, now seen corresponding path program 1 times [2021-03-26 00:33:19,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:19,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88177257] [2021-03-26 00:33:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:19,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:19,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:19,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:19,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88177257] [2021-03-26 00:33:19,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:19,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:33:19,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970861818] [2021-03-26 00:33:19,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:33:19,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:33:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:33:19,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172 [2021-03-26 00:33:19,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:19,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172 [2021-03-26 00:33:19,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:19,945 INFO L129 PetriNetUnfolder]: 17/79 cut-off events. [2021-03-26 00:33:19,945 INFO L130 PetriNetUnfolder]: For 74/76 co-relation queries the response was YES. [2021-03-26 00:33:19,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 79 events. 17/79 cut-off events. For 74/76 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 7 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 172. Up to 34 conditions per place. [2021-03-26 00:33:19,948 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 3 selfloop transitions, 3 changer transitions 3/27 dead transitions. [2021-03-26 00:33:19,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 116 flow [2021-03-26 00:33:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:33:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:33:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2021-03-26 00:33:19,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8255813953488372 [2021-03-26 00:33:19,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2021-03-26 00:33:19,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2021-03-26 00:33:19,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:19,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2021-03-26 00:33:19,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:19,954 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 95 flow. Second operand 4 states and 568 transitions. [2021-03-26 00:33:19,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 116 flow [2021-03-26 00:33:19,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:33:19,956 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 96 flow [2021-03-26 00:33:19,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-26 00:33:19,957 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 00:33:19,957 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:19,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 96 flow [2021-03-26 00:33:19,957 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 96 flow [2021-03-26 00:33:19,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 23 transitions, 96 flow [2021-03-26 00:33:19,964 INFO L129 PetriNetUnfolder]: 6/44 cut-off events. [2021-03-26 00:33:19,964 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-26 00:33:19,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 44 events. 6/44 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 2 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 88. Up to 18 conditions per place. [2021-03-26 00:33:19,965 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 00:33:20,176 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:33:20,549 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:33:20,667 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:33:21,261 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2021-03-26 00:33:21,352 INFO L154 LiptonReduction]: Checked pairs total: 349 [2021-03-26 00:33:21,352 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:33:21,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1395 [2021-03-26 00:33:21,353 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 100 flow [2021-03-26 00:33:21,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:21,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:21,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:33:21,354 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1492827030, now seen corresponding path program 2 times [2021-03-26 00:33:21,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:21,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830503264] [2021-03-26 00:33:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:21,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:33:21,410 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:33:21,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:33:21,428 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 00:33:21,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:33:21,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:33:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:21,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830503264] [2021-03-26 00:33:21,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:21,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:21,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949215758] [2021-03-26 00:33:21,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:33:21,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:33:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:33:21,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 175 [2021-03-26 00:33:21,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:21,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 175 [2021-03-26 00:33:21,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:21,587 INFO L129 PetriNetUnfolder]: 55/154 cut-off events. [2021-03-26 00:33:21,587 INFO L130 PetriNetUnfolder]: For 190/192 co-relation queries the response was YES. [2021-03-26 00:33:21,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 154 events. 55/154 cut-off events. For 190/192 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 755 event pairs, 9 based on Foata normal form. 9/160 useless extension candidates. Maximal degree in co-relation 402. Up to 68 conditions per place. [2021-03-26 00:33:21,588 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 13 selfloop transitions, 9 changer transitions 1/34 dead transitions. [2021-03-26 00:33:21,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 188 flow [2021-03-26 00:33:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:33:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:33:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2021-03-26 00:33:21,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7559183673469387 [2021-03-26 00:33:21,591 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2021-03-26 00:33:21,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2021-03-26 00:33:21,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:21,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2021-03-26 00:33:21,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,597 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,597 INFO L185 Difference]: Start difference. First operand has 38 places, 22 transitions, 100 flow. Second operand 7 states and 926 transitions. [2021-03-26 00:33:21,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 188 flow [2021-03-26 00:33:21,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 166 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-26 00:33:21,601 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 128 flow [2021-03-26 00:33:21,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-26 00:33:21,601 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 00:33:21,601 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:21,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 128 flow [2021-03-26 00:33:21,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 128 flow [2021-03-26 00:33:21,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 128 flow [2021-03-26 00:33:21,618 INFO L129 PetriNetUnfolder]: 24/87 cut-off events. [2021-03-26 00:33:21,619 INFO L130 PetriNetUnfolder]: For 123/140 co-relation queries the response was YES. [2021-03-26 00:33:21,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 87 events. 24/87 cut-off events. For 123/140 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 366 event pairs, 10 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 241. Up to 49 conditions per place. [2021-03-26 00:33:21,620 INFO L142 LiptonReduction]: Number of co-enabled transitions 180 [2021-03-26 00:33:21,679 INFO L154 LiptonReduction]: Checked pairs total: 94 [2021-03-26 00:33:21,679 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:33:21,679 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-26 00:33:21,681 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 128 flow [2021-03-26 00:33:21,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:21,681 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:21,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:33:21,681 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1358386472, now seen corresponding path program 1 times [2021-03-26 00:33:21,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:21,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747597615] [2021-03-26 00:33:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:21,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:21,741 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:33:21,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:33:21,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:21,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747597615] [2021-03-26 00:33:21,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:21,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:21,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14198096] [2021-03-26 00:33:21,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:33:21,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:33:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:33:21,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 175 [2021-03-26 00:33:21,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:21,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 175 [2021-03-26 00:33:21,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:21,828 INFO L129 PetriNetUnfolder]: 116/284 cut-off events. [2021-03-26 00:33:21,828 INFO L130 PetriNetUnfolder]: For 252/275 co-relation queries the response was YES. [2021-03-26 00:33:21,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 284 events. 116/284 cut-off events. For 252/275 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1623 event pairs, 48 based on Foata normal form. 27/295 useless extension candidates. Maximal degree in co-relation 701. Up to 157 conditions per place. [2021-03-26 00:33:21,830 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-26 00:33:21,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 180 flow [2021-03-26 00:33:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:33:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:33:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-26 00:33:21,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8491428571428571 [2021-03-26 00:33:21,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-26 00:33:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-26 00:33:21,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:21,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-26 00:33:21,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,837 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 128 flow. Second operand 5 states and 743 transitions. [2021-03-26 00:33:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 180 flow [2021-03-26 00:33:21,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 170 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:33:21,840 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 178 flow [2021-03-26 00:33:21,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-26 00:33:21,840 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:33:21,840 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:21,840 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 178 flow [2021-03-26 00:33:21,840 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 178 flow [2021-03-26 00:33:21,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 178 flow [2021-03-26 00:33:21,870 INFO L129 PetriNetUnfolder]: 114/281 cut-off events. [2021-03-26 00:33:21,870 INFO L130 PetriNetUnfolder]: For 340/415 co-relation queries the response was YES. [2021-03-26 00:33:21,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 281 events. 114/281 cut-off events. For 340/415 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1664 event pairs, 46 based on Foata normal form. 5/260 useless extension candidates. Maximal degree in co-relation 848. Up to 162 conditions per place. [2021-03-26 00:33:21,873 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-26 00:33:21,881 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-26 00:33:21,881 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:33:21,881 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-26 00:33:21,882 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 172 flow [2021-03-26 00:33:21,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:21,882 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:21,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:33:21,883 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1676137979, now seen corresponding path program 1 times [2021-03-26 00:33:21,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:21,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765282869] [2021-03-26 00:33:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:21,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:21,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:21,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:21,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:21,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765282869] [2021-03-26 00:33:21,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:21,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:33:21,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541522918] [2021-03-26 00:33:21,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:33:21,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:33:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:33:21,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 175 [2021-03-26 00:33:21,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:21,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:21,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 175 [2021-03-26 00:33:21,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:22,011 INFO L129 PetriNetUnfolder]: 177/411 cut-off events. [2021-03-26 00:33:22,011 INFO L130 PetriNetUnfolder]: For 990/1099 co-relation queries the response was YES. [2021-03-26 00:33:22,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 411 events. 177/411 cut-off events. For 990/1099 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2477 event pairs, 78 based on Foata normal form. 21/405 useless extension candidates. Maximal degree in co-relation 1243. Up to 246 conditions per place. [2021-03-26 00:33:22,015 INFO L132 encePairwiseOnDemand]: 170/175 looper letters, 3 selfloop transitions, 3 changer transitions 2/31 dead transitions. [2021-03-26 00:33:22,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 177 flow [2021-03-26 00:33:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:33:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:33:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2021-03-26 00:33:22,017 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8102857142857143 [2021-03-26 00:33:22,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2021-03-26 00:33:22,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2021-03-26 00:33:22,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:22,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2021-03-26 00:33:22,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,022 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,022 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 172 flow. Second operand 5 states and 709 transitions. [2021-03-26 00:33:22,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 177 flow [2021-03-26 00:33:22,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:33:22,027 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 161 flow [2021-03-26 00:33:22,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2021-03-26 00:33:22,028 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-26 00:33:22,028 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:22,028 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 161 flow [2021-03-26 00:33:22,028 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 161 flow [2021-03-26 00:33:22,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 29 transitions, 161 flow [2021-03-26 00:33:22,058 INFO L129 PetriNetUnfolder]: 101/243 cut-off events. [2021-03-26 00:33:22,058 INFO L130 PetriNetUnfolder]: For 397/411 co-relation queries the response was YES. [2021-03-26 00:33:22,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 243 events. 101/243 cut-off events. For 397/411 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1280 event pairs, 47 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 728. Up to 133 conditions per place. [2021-03-26 00:33:22,061 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 00:33:22,093 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:33:22,093 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:33:22,093 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-26 00:33:22,095 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 164 flow [2021-03-26 00:33:22,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:22,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:22,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:33:22,096 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1024992211, now seen corresponding path program 2 times [2021-03-26 00:33:22,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:22,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258030140] [2021-03-26 00:33:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:22,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:22,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:22,159 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:33:22,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:33:22,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:22,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258030140] [2021-03-26 00:33:22,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:22,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:33:22,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816906236] [2021-03-26 00:33:22,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:33:22,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:33:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:33:22,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 176 [2021-03-26 00:33:22,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:22,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 176 [2021-03-26 00:33:22,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:22,233 INFO L129 PetriNetUnfolder]: 53/168 cut-off events. [2021-03-26 00:33:22,234 INFO L130 PetriNetUnfolder]: For 243/281 co-relation queries the response was YES. [2021-03-26 00:33:22,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 168 events. 53/168 cut-off events. For 243/281 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 846 event pairs, 8 based on Foata normal form. 41/205 useless extension candidates. Maximal degree in co-relation 594. Up to 105 conditions per place. [2021-03-26 00:33:22,235 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 11 changer transitions 3/39 dead transitions. [2021-03-26 00:33:22,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 260 flow [2021-03-26 00:33:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:33:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:33:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2021-03-26 00:33:22,238 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494318181818182 [2021-03-26 00:33:22,238 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 897 transitions. [2021-03-26 00:33:22,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 897 transitions. [2021-03-26 00:33:22,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:22,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 897 transitions. [2021-03-26 00:33:22,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,244 INFO L185 Difference]: Start difference. First operand has 45 places, 29 transitions, 164 flow. Second operand 6 states and 897 transitions. [2021-03-26 00:33:22,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 260 flow [2021-03-26 00:33:22,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 248 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:33:22,248 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 240 flow [2021-03-26 00:33:22,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-26 00:33:22,248 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-26 00:33:22,248 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:22,249 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 240 flow [2021-03-26 00:33:22,249 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 240 flow [2021-03-26 00:33:22,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 240 flow [2021-03-26 00:33:22,267 INFO L129 PetriNetUnfolder]: 49/162 cut-off events. [2021-03-26 00:33:22,267 INFO L130 PetriNetUnfolder]: For 305/312 co-relation queries the response was YES. [2021-03-26 00:33:22,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 162 events. 49/162 cut-off events. For 305/312 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 804 event pairs, 8 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 613. Up to 99 conditions per place. [2021-03-26 00:33:22,269 INFO L142 LiptonReduction]: Number of co-enabled transitions 160 [2021-03-26 00:33:22,275 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:33:22,276 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:33:22,276 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 00:33:22,276 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 232 flow [2021-03-26 00:33:22,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:22,277 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:22,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:33:22,277 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:22,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 46110563, now seen corresponding path program 1 times [2021-03-26 00:33:22,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:22,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207356994] [2021-03-26 00:33:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:33:22,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:22,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:22,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:33:22,362 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:33:22,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:33:22,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:33:22,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:33:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:33:22,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207356994] [2021-03-26 00:33:22,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:33:22,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:33:22,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445485381] [2021-03-26 00:33:22,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:33:22,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:33:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:33:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:33:22,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 176 [2021-03-26 00:33:22,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:33:22,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 176 [2021-03-26 00:33:22,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:33:22,439 INFO L129 PetriNetUnfolder]: 27/97 cut-off events. [2021-03-26 00:33:22,439 INFO L130 PetriNetUnfolder]: For 213/225 co-relation queries the response was YES. [2021-03-26 00:33:22,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 97 events. 27/97 cut-off events. For 213/225 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 2 based on Foata normal form. 24/119 useless extension candidates. Maximal degree in co-relation 395. Up to 58 conditions per place. [2021-03-26 00:33:22,440 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 2 selfloop transitions, 11 changer transitions 5/36 dead transitions. [2021-03-26 00:33:22,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 264 flow [2021-03-26 00:33:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:33:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:33:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1040 transitions. [2021-03-26 00:33:22,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2021-03-26 00:33:22,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1040 transitions. [2021-03-26 00:33:22,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1040 transitions. [2021-03-26 00:33:22,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:33:22,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1040 transitions. [2021-03-26 00:33:22,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.57142857142858) internal successors, (1040), 7 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:22,448 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 232 flow. Second operand 7 states and 1040 transitions. [2021-03-26 00:33:22,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 264 flow [2021-03-26 00:33:22,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 235 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 00:33:22,450 INFO L241 Difference]: Finished difference. Result has 52 places, 31 transitions, 203 flow [2021-03-26 00:33:22,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2021-03-26 00:33:22,451 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 00:33:22,451 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:33:22,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 31 transitions, 203 flow [2021-03-26 00:33:22,451 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 31 transitions, 203 flow [2021-03-26 00:33:22,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 203 flow [2021-03-26 00:33:22,458 INFO L129 PetriNetUnfolder]: 16/62 cut-off events. [2021-03-26 00:33:22,459 INFO L130 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2021-03-26 00:33:22,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 62 events. 16/62 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 177 event pairs, 1 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 221. Up to 20 conditions per place. [2021-03-26 00:33:22,459 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-26 00:33:22,777 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:33:22,930 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:33:23,147 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 00:33:23,598 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2021-03-26 00:33:23,751 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:33:24,407 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 00:33:24,637 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:33:26,070 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-26 00:33:26,673 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:33:26,678 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 00:33:26,678 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:33:26,679 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4228 [2021-03-26 00:33:26,679 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 189 flow [2021-03-26 00:33:26,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:33:26,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:33:26,680 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:33:26,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:33:26,680 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:33:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:33:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1488471677, now seen corresponding path program 1 times [2021-03-26 00:33:26,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:33:26,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485551375] [2021-03-26 00:33:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:33:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:33:26,720 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:33:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:33:26,753 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:33:26,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:33:26,781 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:33:26,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:33:26,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:33:26 BasicIcfg [2021-03-26 00:33:26,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:33:26,849 INFO L168 Benchmark]: Toolchain (without parser) took 23569.59 ms. Allocated memory was 341.8 MB in the beginning and 660.6 MB in the end (delta: 318.8 MB). Free memory was 305.1 MB in the beginning and 447.4 MB in the end (delta: -142.3 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,850 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 341.8 MB. Free memory was 323.4 MB in the beginning and 323.4 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:33:26,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.39 ms. Allocated memory is still 341.8 MB. Free memory was 304.9 MB in the beginning and 300.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.58 ms. Allocated memory is still 341.8 MB. Free memory was 300.5 MB in the beginning and 297.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,850 INFO L168 Benchmark]: Boogie Preprocessor took 63.49 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,850 INFO L168 Benchmark]: RCFGBuilder took 1797.51 ms. Allocated memory is still 341.8 MB. Free memory was 295.3 MB in the beginning and 236.1 MB in the end (delta: 59.2 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,851 INFO L168 Benchmark]: TraceAbstraction took 21052.31 ms. Allocated memory was 341.8 MB in the beginning and 660.6 MB in the end (delta: 318.8 MB). Free memory was 235.1 MB in the beginning and 447.4 MB in the end (delta: -212.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:33:26,852 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.56 ms. Allocated memory is still 341.8 MB. Free memory was 323.4 MB in the beginning and 323.4 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 569.39 ms. Allocated memory is still 341.8 MB. Free memory was 304.9 MB in the beginning and 300.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.58 ms. Allocated memory is still 341.8 MB. Free memory was 300.5 MB in the beginning and 297.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 63.49 ms. Allocated memory is still 341.8 MB. Free memory was 297.4 MB in the beginning and 295.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1797.51 ms. Allocated memory is still 341.8 MB. Free memory was 295.3 MB in the beginning and 236.1 MB in the end (delta: 59.2 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21052.31 ms. Allocated memory was 341.8 MB in the beginning and 660.6 MB in the end (delta: 318.8 MB). Free memory was 235.1 MB in the beginning and 447.4 MB in the end (delta: -212.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7978.0ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 1304, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1081, positive: 1047, positive conditional: 0, positive unconditional: 1047, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1081, positive: 1047, positive conditional: 0, positive unconditional: 1047, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1081, positive: 1038, positive conditional: 0, positive unconditional: 1038, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 592, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 557, negative conditional: 0, negative unconditional: 557, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1376, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 1081, unknown conditional: 1081, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 49, Positive conditional cache size: 49, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2836.6ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 262, positive conditional: 262, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 53, positive conditional: 5, positive unconditional: 48, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 53, positive conditional: 5, positive unconditional: 48, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 151, negative conditional: 20, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 351, positive: 209, positive conditional: 209, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1258.8ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 219, positive: 159, positive conditional: 159, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 219, positive: 147, positive conditional: 147, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.5ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 4, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 96, Positive conditional cache size: 96, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.1ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 184 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 4, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 100, Positive conditional cache size: 100, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 309.2ms, 35 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 374 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 18, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 18, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 276, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 276, negative conditional: 0, negative unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 87, Positive conditional cache size: 87, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 154.8ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 145 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 1, positive unconditional: 0, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 91, negative conditional: 6, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1394.9ms, 39 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 349 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 19, positive conditional: 13, positive unconditional: 6, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 19, positive conditional: 13, positive unconditional: 6, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, positive: 75, positive conditional: 73, positive unconditional: 3, negative: 159, negative conditional: 8, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 63, Positive conditional cache size: 63, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.3ms, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, 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: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.8ms, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 91, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.8ms, 47 PlacesBefore, 45 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4227.3ms, 52 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, 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: 11, positive: 11, positive conditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1807; [L819] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1808; [L821] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1809; [L823] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 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) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] 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)) [L843] 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)) [L844] 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)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] 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)) [L845] 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)) [L846] 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)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20881.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 886.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8046.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 41 SDtfs, 20 SDslu, 17 SDs, 0 SdLazy, 190 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 226.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 201.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=11, InterpolantAutomatonStates: 54, 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: 39.0ms SsaConstructionTime, 399.4ms SatisfiabilityAnalysisTime, 754.3ms InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...